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 30, issue 4, 2018

Disjunctive Programming for Multiobjective Discrete Optimisation pp. 625-633

Tolga Bektaş

Computable Error Bounds of Laplace Inversion for Pricing Asian Options pp. 634-645

Yingda Song, Ning Cai and Steven Kou

The Meet-in-the-Middle Principle for Cutting and Packing Problems pp. 646-661

Jean-François Côté and Manuel Iori

Exact Algorithms for Distributionally β -Robust Machine Scheduling with Uncertain Processing Times pp. 662-676

Yuli Zhang, Zuo-Jun Max Shen and Shiji Song

Surrogate-Based Promising Area Search for Lipschitz Continuous Simulation Optimization pp. 677-693

Qi Fan and Jiaqiao Hu

A Joint Vehicle Routing and Speed Optimization Problem pp. 694-709

Ricardo Fukasawa, Qie He, Fernando Santos and Yongjia Song

Mathematical Programming Algorithms for Spatial Cloaking pp. 710-723

Alberto Ceselli, Maria Luisa Damiani, Giovanni Righini and Diego Valorsi

Methods for System Selection Based on Sequential Mean–Variance Analysis pp. 724-738

Demet Batur, Lina Wang and F. Fred Choobineh

The Ramping Polytope and Cut Generation for the Unit Commitment Problem pp. 739-749

Ben Knueven, Jim Ostrowski and Jianhui Wang

A Knowledge Gradient Policy for Sequencing Experiments to Identify the Structure of RNA Molecules Using a Sparse Additive Belief Model pp. 750-767

Yan Li, Kristofer G. Reyes, Jorge Vazquez-Anderson, Yingfei Wang, Lydia M. Contreras and Warren B. Powell

A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching pp. 768-782

Daniel Kowalczyk and Roel Leus

Volume 30, issue 3, 2018

Quadratic Combinatorial Optimization Using Separable Underestimators pp. 424-437

Christoph Buchheim and Emiliano Traversi

T -Closeness Slicing: A New Privacy-Preserving Approach for Transactional Data Publishing pp. 438-453

Mingzheng Wang, Zhengrui Jiang, Haifang Yang and Yu Zhang

Portfolio Optimization with Nonparametric Value at Risk: A Block Coordinate Descent Method pp. 454-471

Xueting Cui, Xiaoling Sun, Shushang Zhu, Rujun Jiang and Duan Li

Scenario Generation for Single-Period Portfolio Selection Problems with Tail Risk Measures: Coping with High Dimensions and Integer Variables pp. 472-491

Jamie Fairbrother, Amanda Turner and Stein Wallace

An Extended Mixed-Integer Programming Formulation and Dynamic Cut Generation Approach for the Stochastic Lot-Sizing Problem pp. 492-506

Huseyin Tunc, Onur A. Kilic, S. Armagan Tarim and Roberto Rossi

Spare Parts Inventory Management with Substitution-Dependent Reliability pp. 507-521

Amin Khademi and Burak Eksioglu

Lateness Minimization in Pairwise Connectivity Restoration Problems pp. 522-538

Igor Averbakh and Jordi Pereira

Risk Averse Shortest Paths: A Computational Study pp. 539-553

Renaud Chicoisne, Fernando Ordóñez and Daniel Espinoza

The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches pp. 554-569

Claudio Gambella, Joe Naoum-Sawaya and Bissan Ghaddar

Structure Detection in Mixed-Integer Programs pp. 570-587

Taghi Khaniyev, Samir Elhedhli and Fatih Safa Erenay

Physician Staffing for Emergency Departments with Time-Varying Demand pp. 588-607

Ran Liu and Xiaolan Xie

What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO pp. 608-624

Iain Dunning, Swati Gupta and John Silberholz

Volume 30, issue 2, 2018

Computing Minimum k -Connected m -Fold Dominating Set in General Graphs pp. 217-224

Zhao Zhang, Jiao Zhou, Shaojie Tang, Xiaohui Huang and Ding-Zhu Du

Breaking the O (ln n ) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set pp. 225-235

Jiao Zhou, Zhao Zhang, Shaojie Tang, Xiaohui Huang and Ding-Zhu Du

Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines pp. 236-258

Tao Wu, Zhe Liang and Canrong Zhang

Optimizing Chemoradiotherapy to Target Metastatic Disease and Tumor Growth pp. 259-277

Hamidreza Badri, Ehsan Salari, Yoichi Watanabe and Kevin Leder

Some Monotonicity Results for Stochastic Kriging Metamodels in Sequential Settings pp. 278-294

Bing Wang and Jiaqiao Hu

Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study pp. 295-308

Krešimir Mihić, Kevin Ryan and Alan Wood

Solving Highly Detailed Gas Transport MINLPs: Block Separability and Penalty Alternating Direction Methods pp. 309-323

Björn Geißler, Antonio Morsi, Lars Schewe and Martin Schmidt

Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming pp. 324-338

Nathan Adelgren, Pietro Belotti and Akshay Gupte

Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation pp. 339-360

A. Pessoa, R. Sadykov, E. Uchoa and F. Vanderbeck

An Open-Source Desktop Application for Generating Arc-Routing Benchmark Instances pp. 361-370

Oliver Lum, Bruce Golden and Edward Wasil

Optimal Design of the Seasonal Influenza Vaccine with Manufacturing Autonomy pp. 371-387

Osman Y. Özaltın, Oleg A. Prokopyev and Andrew J. Schaefer

Partially Adaptive Stochastic Optimization for Electric Power Generation Expansion Planning pp. 388-401

Jikai Zou, Shabbir Ahmed and Xu Andy Sun

A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems pp. 402-420

Markus Leitner, Ivana Ljubić, Martin Luipersbeck and Markus Sinnl

Volume 30, issue 1, 2018

Space Reduction for a Class of Multidimensional Markov Chains: A Summary and Some Applications pp. 1-10

Qi-Ming He and Attahiru Sule Alfa

FiberSCIP—A Shared Memory Parallelization of SCIP pp. 11-30

Yuji Shinano, Stefan Heinz, Stefan Vigerske and Michael Winkler

Computing the Maximum Volume Inscribed Ellipsoid of a Polytopic Projection pp. 31-42

Jianzhe Zhen and Dick den Hertog

Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem pp. 43-56

Betül Ahat, T?naz Ekim and Z. Caner Taşkın

Adaptive Partition-Based Level Decomposition Methods for Solving Two-Stage Stochastic Programs with Fixed Recourse pp. 57-70

Wim van Ackooij, Welington de Oliveira and Yongjia Song

A Rare-Event Simulation Algorithm for Periodic Single-Server Queues pp. 71-89

Ni Ma and Ward Whitt

Parallel Scenario Decomposition of Risk-Averse 0-1 Stochastic Programs pp. 90-105

Yan Deng, Shabbir Ahmed and Siqian Shen

Benchmarking a Scalable Approximate Dynamic Programming Algorithm for Stochastic Control of Grid-Level Energy Storage pp. 106-123

Daniel F. Salas and Warren B. Powell

Integrated Supply Chain Management via Randomized Rounding pp. 124-136

Lehilton L. C. Pedrosa and Maxim Sviridenko

Incremental Upper Bound for the Maximum Clique Problem pp. 137-153

Chu-Min Li, Zhiwen Fang, Hua Jiang and Ke Xu

Gradient-Based Adaptive Stochastic Search for Simulation Optimization Over Continuous Space pp. 154-167

Enlu Zhou and Shalabh Bhatnagar

A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization pp. 168-180

Roberto Cordone, Pierre Hosteins and Giovanni Righini

A Data-Driven Model of an Appointment-Generated Arrival Process at an Outpatient Clinic pp. 181-199

Song-Hee Kim, Ward Whitt and Won Chul Cha

Optimal Sampling for Simulated Annealing Under Noise pp. 200-215

Robin C. Ball, Juergen Branke and Stephan Meisel