INFORMS Journal on Computing

2017 - 2025

From INFORMS
Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().

Access Statistics for this journal.
Is something missing from the series or not right? See the RePEc data check for the archive and series.

Volume 31, issue 4, 2019

In Memoriam: Shabbir Ahmed (1969–2019) pp. 633-635

J. Cole Smith

Toward Computing the Margin of Victory in Single Transferable Vote Elections pp. 636-653

Michelle Blom, Peter J. Stuckey and Vanessa J. Teague

Vehicle Routing with Space- and Time-Correlated Stochastic Travel Times: Evaluating the Objective Function pp. 654-670

Zhaoxia Guo, Stein Wallace and Michal Kaut

Learning to Rank in Entity Relationship Graphs pp. 671-688

Louiqa Raschid, Hassan Sayyadi and Vagelis Hristidis

Surrogate Optimization of Computationally Expensive Black-Box Problems with Hidden Constraints pp. 689-702

Juliane Müller and Marcus Day

Identification of Essential Proteins Using Induced Stars in Protein–Protein Interaction Networks pp. 703-718

Chrysafis Vogiatzis and Mustafa Can Camur

Group Maintenance: A Restless Bandits Approach pp. 719-731

Abderrahmane Abbou and Viliam Makis

Planning for Overtime: The Value of Shift Extensions in Physician Scheduling pp. 732-744

Andreas Fügener and Jens O. Brunner

An Efficient Morris Method-Based Framework for Simulation Factor Screening pp. 745-770

Wen Shi, Xi Chen and Jennifer Shang

Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters pp. 771-789

Ketan Date and Rakesh Nagi

Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets pp. 790-804

Sune Lauth Gadegaard, Lars Relund Nielsen and Matthias Ehrgott

Branch-and-Bound for Bi-objective Integer Programming pp. 805-822

Sophie N. Parragh and Fabien Tricoire

A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs pp. 823-840

Alvaro Sierra Altamiranda and Hadi Charkhgard

Volume 31, issue 3, 2019

Note from the Editor pp. 411–412

Alice E. Smith

No-Wait Scheduling for Locks pp. 413–428

Ward Passchyn, Dirk Briskorn and Frits C. R. Spieksma

Enriching Solutions to Combinatorial Problems via Solution Engineering pp. 429–444

Thierry Petit and Andrew C. Trapp

Robust Maximum Likelihood Estimation pp. 445–458

Dimitris Bertsimas and Omid Nohadani

Identifying Fixations in Gaze Data via Inner Density and Optimization pp. 459–476

Andrew C. Trapp, Wen Liu and Soussan Djamasbi

An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating pp. 477–492

David Bergman

Integrated Scheduling of Production and Two-Stage Delivery of Make-to-Order Products: Offline and Online Algorithms pp. 493–514

Lixin Tang, Feng Li and Zhi-Long Chen

Computing the Moments of Polling Models with Batch Poisson Arrivals by Transform Inversion pp. 515–526

Wu-Lin Chen

Two-Dimensional Phase Unwrapping via Balanced Spanning Forests pp. 527–543

Ian Herszterg, Marcus Poggi and Thibaut Vidal

Real-Time Radiation Treatment Planning with Optimality Guarantees via Cluster and Bound Methods pp. 544–558

Baris Ungun, Lei Xing and Stephen Boyd

Chance-Constrained Surgery Planning Under Conditions of Limited and Ambiguous Data pp. 559–575

Yan Deng, Siqian Shen and Brian Denton

Virtual Statistics in Simulation via k Nearest Neighbors pp. 576–592

Yujing Lin, Barry L. Nelson and Linda Pei

A Dynamic Programming Approach to Power Consumption Minimization in Gunbarrel Natural Gas Networks with Nonidentical Compressor Units pp. 593–611

Tianhu Deng, Yong Liang, Shixuan Zhang, Jingze Ren and Shuyi Zheng

Permutations in the Factorization of Simplex Bases pp. 612–632

Ricardo Fukasawa and Laurent Poirrier

Volume 31, issue 2, 2019

Transit Pattern Detection Using Tensor Factorization pp. 193-206

Bowen Du, Wenjun Zhou, Chuanren Liu, Yifeng Cui and Hui Xiong

Performance Comparison of Machine Learning Platforms pp. 207-225

Asim Roy, Shiban Qureshi, Kartikeya Pande, Divitha Nair, Kartik Gairola, Pooja Jain, Suraj Singh, Kirti Sharma, Akshay Jagadale, Yi-Yang Lin, Shashank Sharma, Ramya Gotety, Yuexin Zhang, Ji Tang, Tejas Mehta, Hemanth Sindhanuru, Nonso Okafor, Santak Das, Chidambara N. Gopal, Srinivasa B. Rudraraju and Avinash V. Kakarlapudi

Efficient Convexification Strategy for Generalized Geometric Programming Problems pp. 226-234

Hao-Chun Lu and Liming Yao

Continuous Variable Neighborhood Search (C-VNS) for Solving Systems of Nonlinear Equations pp. 235-250

Jun Pei, Zorica Dražić, Milan Dražić, Nenad Mladenović and Panos M. Pardalos

Primal Heuristics for Branch and Price: The Assets of Diving Methods pp. 251-267

Ruslan Sadykov, François Vanderbeck, Artur Pessoa, Issam Tahiri and Eduardo Uchoa

New Valid Inequalities for the Optimal Communication Spanning Tree Problem pp. 268-284

Yogesh Kumar Agarwal and Prahalad Venkateshan

Target Cuts from Relaxed Decision Diagrams pp. 285-301

Christian Tjandraatmadja and Willem-Jan van Hoeve

Solving Large Batches of Linear Programs pp. 302-317

Ilbin Lee, Stewart Curry and Nicoleta Serban

A Branch-and-Bound Approach to the Traveling Salesman Problem with a Drone pp. 335-346

Stefan Poikonen, Bruce Golden and Edward A. Wasil

Modeling and Simulation of Nonstationary Non-Poisson Arrival Processes pp. 347-366

Ran Liu, Michael E. Kuhl, Yunan Liu and James R. Wilson

Finding Critical Links for Closeness Centrality pp. 367-389

Alexander Veremyev, Oleg A. Prokopyev and Eduardo L. Pasiliao

Interdiction Games and Monotonicity, with Application to Knapsack Problems pp. 390-410

Matteo Fischetti, Ivana Ljubić, Michele Monaci and Markus Sinnl

Volume 31, issue 1, 2019

Message from the Editor pp. 1

Alice E. Smith

Data-Driven Decisions for Problems with an Unspecified Objective Function pp. 2-20

Zhen Sun, Milind Dawande, Ganesh Janakiraman and Vijay Mookerjee

An Asymptotically Optimal Set Approach for Simulation Optimization pp. 21-39

Liujia Hu and Sigrún Andradóttir

Dynamic Compressor Optimization in Natural Gas Pipeline Systems pp. 40-65

Terrence W. K. Mak, Pascal Van Hentenryck, Anatoly Zlotnik and Russell Bent

A New Approach to Real-Time Bidding in Online Advertisements: Auto Pricing Strategy pp. 66-82

Shalinda Adikari and Kaushik Dutta

An Approximation Algorithm for Capacity Allocation Over a Single Flight Leg with Fare-Locking pp. 83-99

Mika Sumida and Huseyin Topaloglu

Robust Optimization of Dose-Volume Metrics for Prostate HDR-Brachytherapy Incorporating Target and OAR Volume Delineation Uncertainties pp. 100-114

Marleen Balvert, Dick den Hertog and Aswin L. Hoffmann

A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming pp. 115-133

Aritra Pal and Hadi Charkhgard

A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing pp. 134-152

Masoud Chitsaz, Jean-François Cordeau and Raf Jans

Stochastic Network Design for Planning Scheduled Transportation Services: The Value of Deterministic Solutions pp. 153-170

Xin Wang, Teodor Gabriel Crainic and Stein Wallace

Exact Approaches for Network Design Problems with Relays pp. 171-192

Markus Leitner, Ivana Ljubić, Martin Riedler and Mario Ruthmair