Volume 30, Number 4, Fall 2018
A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching.

Daniel Kowalczyk Roel Leus

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

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

The Ramping Polytope and Cut Generation for the Unit Commitment Problem.

Ben Knueven Jim Ostrowski Jianhui Wang

Methods for System Selection Based on Sequential Mean-Variance Analysis.

Demet Batur Lina Wang F. Fred Choobineh

Mathematical Programming Algorithms for Spatial Cloaking.

Alberto Ceselli Maria Luisa Damiani Giovanni Righini Diego Valorsi

A Joint Vehicle Routing and Speed Optimization Problem.

Ricardo Fukasawa Qie He Fernando Santos Yongjia Song

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

Qi Fan Jiaqiao Hu

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

Yuli Zhang Zuo-Jun Max Shen Shiji Song

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

Jean-François Côté Manuel Iori

Computable Error Bounds of Laplace Inversion for Pricing Asian Options.

Yingda Song Ning Cai Steven Kou

Disjunctive Programming for Multiobjective Discrete Optimisation.

Tolga Bektas


Volume 30, Number 3, Summer 2018
What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO.

Iain Dunning Swati Gupta John Silberholz

Physician Staffing for Emergency Departments with Time-Varying Demand.

Ran Liu Xiaolan Xie

Structure Detection in Mixed-Integer Programs.

Taghi Khaniyev Samir Elhedhli Fatih Safa Erenay

The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches.

Claudio Gambella Joe Naoum-Sawaya Bissan Ghaddar

Risk Averse Shortest Paths: A Computational Study.

Renaud Chicoisne Fernando Ordóñez Daniel G. Espinoza

Lateness Minimization in Pairwise Connectivity Restoration Problems.

Igor Averbakh Jordi Pereira

Spare Parts Inventory Management with Substitution-Dependent Reliability.

Amin Khademi Burak Eksioglu

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

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

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

Jamie Fairbrother Amanda Turner Stein W. Wallace

Portfolio Optimization with Nonparametric Value at Risk: A Block Coordinate Descent Method.

Xueting Cui Xiaoling Sun Shushang Zhu Rujun Jiang Duan Li

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

Mingzheng Wang Zhengrui Jiang Yu Zhang Haifang Yang

Quadratic Combinatorial Optimization Using Separable Underestimators.

Christoph Buchheim Emiliano Traversi

A Memorial to Harvey J. Greenberg, Founding Editor of the INFORMS Journal on Computing.

Allen Holder Fred Murphy William P. Pierskalla


Volume 30, Number 2, Spring 2018
A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems.

Markus Leitner Ivana Ljubic Martin Luipersbeck Markus Sinnl

Partially Adaptive Stochastic Optimization for Electric Power Generation Expansion Planning.

Jikai Zou Shabbir Ahmed Xu Andy Sun

Optimal Design of the Seasonal Influenza Vaccine with Manufacturing Autonomy.

Osman Y. Özaltin Oleg A. Prokopyev Andrew J. Schaefer

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

Oliver Lum Bruce L. Golden Edward A. Wasil

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

Artur Alves Pessoa Ruslan Sadykov Eduardo Uchoa François Vanderbeck

Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming.

Nathan Adelgren Pietro Belotti Akshay Gupte

Solving Highly Detailed Gas Transport MINLPs: Block Separability and Penalty Alternating Direction Methods.

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

Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study.

Kresimir Mihic Kevin Ryan Alan Wood

Some Monotonicity Results for Stochastic Kriging Metamodels in Sequential Settings.

Bing Wang Jiaqiao Hu

Optimizing Chemoradiotherapy to Target Metastatic Disease and Tumor Growth.

Hamidreza Badri Ehsan Salari Yoichi Watanabe Kevin Leder

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

Tao Wu Zhe Liang Canrong Zhang

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

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

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

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


Volume 30, Number 1, Winter 2018
Optimal Sampling for Simulated Annealing Under Noise.

Robin C. Ball Jürgen Branke Stephan Meisel

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

Song-Hee Kim Ward Whitt Won Chul Cha

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

Roberto Cordone Pierre Hosteins Giovanni Righini

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

Enlu Zhou Shalabh Bhatnagar

Incremental Upper Bound for the Maximum Clique Problem.

Chu-Min Li Zhiwen Fang Hua Jiang Ke Xu

Integrated Supply Chain Management via Randomized Rounding.

Lehilton L. C. Pedrosa Maxim Sviridenko

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

Daniel F. Salas Warren B. Powell

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

Yan Deng Shabbir Ahmed Siqian Shen

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

Ni Ma Ward Whitt

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

Wim van Ackooij Welington de Oliveira Yongjia Song

Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem.

Betül Ahat Tínaz Ekim Z. Caner Taskin

Computing the Maximum Volume Inscribed Ellipsoid of a Polytopic Projection.

Jianzhe Zhen Dick den Hertog

FiberSCIP - A Shared Memory Parallelization of SCIP.

Yuji Shinano Stefan Heinz Stefan Vigerske Michael Winkler

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

Qi-Ming He Attahiru Sule Alfa