External Links

    Journal: INFORMS Journal on Computing

    Volume 30, Issue 4

    625 -- 633Tolga Bektas. Disjunctive Programming for Multiobjective Discrete Optimisation
    634 -- 645Yingda Song, Ning Cai 0003, Steven Kou. Computable Error Bounds of Laplace Inversion for Pricing Asian Options
    646 -- 661Jean-François Côté, Manuel Iori. The Meet-in-the-Middle Principle for Cutting and Packing Problems
    662 -- 676Yuli Zhang, Zuo-Jun Max Shen, Shiji Song. Exact Algorithms for Distributionally β-Robust Machine Scheduling with Uncertain Processing Times
    677 -- 693Qi Fan, Jiaqiao Hu. Surrogate-Based Promising Area Search for Lipschitz Continuous Simulation Optimization
    694 -- 709Ricardo Fukasawa, Qie He, Fernando Santos, Yongjia Song. A Joint Vehicle Routing and Speed Optimization Problem
    710 -- 723Alberto Ceselli, Maria Luisa Damiani, Giovanni Righini, Diego Valorsi. Mathematical Programming Algorithms for Spatial Cloaking
    724 -- 738Demet Batur, Lina Wang, F. Fred Choobineh. Methods for System Selection Based on Sequential Mean-Variance Analysis
    739 -- 749Ben Knueven, Jim Ostrowski, Jianhui Wang. The Ramping Polytope and Cut Generation for the Unit Commitment Problem
    750 -- 767Yan Li 0013, Kristofer G. Reyes, Jorge Vazquez-Anderson, Yingfei Wang, Lydia M. Contreras, Warren B. Powell. A Knowledge Gradient Policy for Sequencing Experiments to Identify the Structure of RNA Molecules Using a Sparse Additive Belief Model
    768 -- 782Daniel Kowalczyk, Roel Leus. A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching

    Volume 30, Issue 3

    421 -- 423Allen Holder, Fred Murphy, William P. Pierskalla. A Memorial to Harvey J. Greenberg, Founding Editor of the INFORMS Journal on Computing
    424 -- 437Christoph Buchheim, Emiliano Traversi. Quadratic Combinatorial Optimization Using Separable Underestimators
    438 -- 453Mingzheng Wang, Zhengrui Jiang, Yu Zhang, Haifang Yang. T-Closeness Slicing: A New Privacy-Preserving Approach for Transactional Data Publishing
    454 -- 471Xueting Cui, Xiaoling Sun 0001, Shushang Zhu, Rujun Jiang, Duan Li 0002. Portfolio Optimization with Nonparametric Value at Risk: A Block Coordinate Descent Method
    472 -- 491Jamie Fairbrother, Amanda Turner, Stein W. Wallace. Scenario Generation for Single-Period Portfolio Selection Problems with Tail Risk Measures: Coping with High Dimensions and Integer Variables
    492 -- 506Huseyin Tunc, Onur A. Kilic, S. Armagan Tarim, Roberto Rossi. An Extended Mixed-Integer Programming Formulation and Dynamic Cut Generation Approach for the Stochastic Lot-Sizing Problem
    507 -- 521Amin Khademi, Burak Eksioglu. Spare Parts Inventory Management with Substitution-Dependent Reliability
    522 -- 538Igor Averbakh, Jordi Pereira. Lateness Minimization in Pairwise Connectivity Restoration Problems
    539 -- 553Renaud Chicoisne, Fernando Ordóñez, Daniel G. Espinoza. Risk Averse Shortest Paths: A Computational Study
    554 -- 569Claudio Gambella, Joe Naoum-Sawaya, Bissan Ghaddar. The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches
    570 -- 587Taghi Khaniyev, Samir Elhedhli, Fatih Safa Erenay. Structure Detection in Mixed-Integer Programs
    588 -- 607Ran Liu, Xiaolan Xie. Physician Staffing for Emergency Departments with Time-Varying Demand
    608 -- 624Iain Dunning, Swati Gupta, John Silberholz. What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO

    Volume 30, Issue 2

    217 -- 224Zhao Zhang 0002, Jiao Zhou, ShaoJie Tang, Xiaohui Huang, Ding-Zhu Du. m-Fold Dominating Set in General Graphs
    225 -- 235Jiao Zhou, Zhao Zhang 0002, ShaoJie Tang, Xiaohui Huang, Ding-Zhu Du. n) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set
    236 -- 258Tao Wu 0004, Zhe Liang, Canrong Zhang. Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines
    259 -- 277Hamidreza Badri, Ehsan Salari, Yoichi Watanabe, Kevin Leder. Optimizing Chemoradiotherapy to Target Metastatic Disease and Tumor Growth
    278 -- 294Bing Wang, Jiaqiao Hu. Some Monotonicity Results for Stochastic Kriging Metamodels in Sequential Settings
    295 -- 308Kresimir Mihic, Kevin Ryan, Alan Wood. Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study
    309 -- 323Björn Geißler, Antonio Morsi, Lars Schewe, Martin Schmidt. Solving Highly Detailed Gas Transport MINLPs: Block Separability and Penalty Alternating Direction Methods
    324 -- 338Nathan Adelgren, Pietro Belotti, Akshay Gupte. Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming
    339 -- 360Artur Alves Pessoa, Ruslan Sadykov, Eduardo Uchoa, François Vanderbeck. Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
    361 -- 370Oliver Lum, Bruce L. Golden, Edward A. Wasil. An Open-Source Desktop Application for Generating Arc-Routing Benchmark Instances
    371 -- 387Osman Y. Özaltin, Oleg A. Prokopyev, Andrew J. Schaefer. Optimal Design of the Seasonal Influenza Vaccine with Manufacturing Autonomy
    388 -- 401Jikai Zou, Shabbir Ahmed, Xu Andy Sun. Partially Adaptive Stochastic Optimization for Electric Power Generation Expansion Planning
    402 -- 420Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Markus Sinnl. A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems

    Volume 30, Issue 1

    1 -- 10Qi-Ming He, Attahiru Sule Alfa. Space Reduction for a Class of Multidimensional Markov Chains: A Summary and Some Applications
    11 -- 30Yuji Shinano, Stefan Heinz 0001, Stefan Vigerske, Michael Winkler. FiberSCIP - A Shared Memory Parallelization of SCIP
    31 -- 42Jianzhe Zhen, Dick den Hertog. Computing the Maximum Volume Inscribed Ellipsoid of a Polytopic Projection
    43 -- 56Betül Ahat, Tinaz Ekim, Z. Caner Taskin. Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem
    57 -- 70Wim van Ackooij, Welington de Oliveira, Yongjia Song. Adaptive Partition-Based Level Decomposition Methods for Solving Two-Stage Stochastic Programs with Fixed Recourse
    71 -- 89Ni Ma, Ward Whitt. A Rare-Event Simulation Algorithm for Periodic Single-Server Queues
    90 -- 105Yan Deng, Shabbir Ahmed, Siqian Shen. Parallel Scenario Decomposition of Risk-Averse 0-1 Stochastic Programs
    106 -- 123Daniel F. Salas, Warren B. Powell. Benchmarking a Scalable Approximate Dynamic Programming Algorithm for Stochastic Control of Grid-Level Energy Storage
    124 -- 136Lehilton L. C. Pedrosa, Maxim Sviridenko. Integrated Supply Chain Management via Randomized Rounding
    137 -- 153Chu Min Li, Zhiwen Fang, Hua Jiang, Ke Xu 0001. Incremental Upper Bound for the Maximum Clique Problem
    154 -- 167Enlu Zhou, Shalabh Bhatnagar. Gradient-Based Adaptive Stochastic Search for Simulation Optimization Over Continuous Space
    168 -- 180Roberto Cordone, Pierre Hosteins, Giovanni Righini. A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization
    181 -- 199Song-Hee Kim, Ward Whitt, Won Chul Cha. A Data-Driven Model of an Appointment-Generated Arrival Process at an Outpatient Clinic
    200 -- 215Robin C. Ball, Jürgen Branke, Stephan Meisel. Optimal Sampling for Simulated Annealing Under Noise
    runs on