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 34, issue 6, 2022

Note from the Editor pp. 2867-2867

Alice Smith

Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph pp. 2868-2872

Illya V. Hicks, Boris Brimkov, Louis Deaett, Ruth Haas, Derek Mikesell, David Roberson and Logan Smith

ROC++: Robust Optimization in C++ pp. 2873-2888

Phebe Vayanos, Qing Jin and George Elissaios

A Stochastic Approximation Method for Simulation-Based Quantile Optimization pp. 2889-2907

Jiaqiao Hu, Yijie Peng, Gongbo Zhang and Qi Zhang

bsnsing: A Decision Tree Induction Method Based on Recursive Optimal Boolean Rule Composition pp. 2908-2929

Yanchao Liu

Solving Large-Scale Fixed-Budget Ranking and Selection Problems pp. 2930-2949

L. Jeff Hong, Guangxin Jiang and Ying Zhong

Setting Reserve Prices in Second-Price Auctions with Unobserved Bids pp. 2950-2967

Jason Rhuggenaath, Alp Akcay, Yingqian Zhang and Uzay Kaymak

An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems pp. 2968-2988

Carina Moreira Costa, Dennis Kreber and Martin Schmidt

Solving Stochastic Optimization with Expectation Constraints Efficiently by a Stochastic Augmented Lagrangian-Type Algorithm pp. 2989-3006

Liwei Zhang, Yule Zhang, Jia Wu and Xiantao Xiao

Bifidelity Surrogate Modelling: Showcasing the Need for New Test Instances pp. 3007-3022

Nicolau Andrés-Thió, Mario Andrés Muñoz and Kate Smith-Miles

A Computational Framework for Solving Nonlinear Binary Optimization Problems in Robust Causal Inference pp. 3023-3041

Md Saiful Islam, Md Sarowar Morshed and Md. Noor-E-Alam

Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining pp. 3042-3058

Alessandro Hill, Andrea J. Brickey, Italo Cipriano, Marcos Goycoolea and Alexandra Newman

Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms pp. 3059-3079

Guopeng Song and Roel Leus

Finding Feasible Systems for Subjective Constraints Using Recycled Observations pp. 3080-3095

Yuwei Zhou, Sigrún Andradóttir, Seong-Hee Kim and Chuljin Park

Toward Efficient Ensemble Learning with Structure Constraints: Convergent Algorithms and Applications pp. 3096-3116

Shao-Bo Lin, Shaojie Tang, Yao Wang and Di Wang

A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems pp. 3117-3133

Marianna De Santis, Sven de Vries, Martin Schmidt and Lukas Winkel

A Branch-and-Price Algorithm for the Multiple Knapsack Problem pp. 3134-3150

Olivier Lalonde, Jean-François Côté and Bernard Gendron

Stochastic Dual Dynamic Programming for Multiechelon Lot Sizing with Component Substitution pp. 3151-3169

Simon Thevenin, Yossiri Adulyasak and Jean-François Cordeau

Augmenting Markov Cohort Analysis to Compute (Co)Variances: Implications for Strength of Cost-Effectiveness pp. 3170-3180

Gordon B. Hazen

On Fault-Tolerant Low-Diameter Clusters in Graphs pp. 3181-3199

Yajun Lu, Hosseinali Salemi, Balabhaskar Balasundaram and Austin Buchanan

An Algorithm for Maximizing a Convex Function Based on Its Minimum pp. 3200-3214

Aharon Ben-Tal and Ernst Roos

Robust Team Orienteering Problem with Decreasing Profits pp. 3215-3233

Qinxiao Yu, Chun Cheng and Ning Zhu

Integrated Backup Rolling Stock Allocation and Timetable Rescheduling with Uncertain Time-Variant Passenger Demand Under Disruptive Events pp. 3234-3258

Jiateng Yin, Lixing Yang, Andrea D’Ariano, Tao Tang and Ziyou Gao

Disjunctive Rule Lists pp. 3259-3276

Ronilo Ragodos and Tong Wang

Robust Adaptive Submodular Maximization pp. 3277-3291

Shaojie Tang

Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows pp. 3292-3308

Gonzalo Lera-Romero, Juan José Miranda Bront and Francisco J. Soulignac

A Polyhedral Study on Fuel-Constrained Unit Commitment pp. 3309-3324

Kai Pan, Ming Zhao, Chung-Lun Li and Feng Qiu

Stability Representations of Many-to-One Matching Problems: An Integer Optimization Approach pp. 3325-3343

Pitchaya Wiratchotisatian, Hoda Atef Yekta and Andrew C. Trapp

Volume 34, issue 5, 2022

Note from the Editor pp. 2383-2383

Alice E. Smith

Finite Difference Gradient Approximation: To Randomize or Not? pp. 2384-2388

Katya Scheinberg

Heterogeneous Multi-resource Allocation with Subset Demand Requests pp. 2389-2399

Arden Baxter, Pinar Keskinocak and Mohit Singh

Stochastic Cutting Planes for Data-Driven Optimization pp. 2400-2409

Dimitris Bertsimas and Michael Lingzhi Li

Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective pp. 2410-2427

Jianzhe Zhen, Ahmadreza Marandi, Danique de Moor, Dick den Hertog and Lieven Vandenberghe

Stochastic Planning and Scheduling with Logic-Based Benders Decomposition pp. 2428-2442

Özgün Elçi and John Hooker

Fine-Grained Job Salary Benchmarking with a Nonparametric Dirichlet Process–Based Latent Factor Model pp. 2443-2463

Qingxin Meng, Keli Xiao, Dazhong Shen, Hengshu Zhu and Hui Xiong

ExpertRNA: A New Framework for RNA Secondary Structure Prediction pp. 2464-2484

Menghan Liu, Erik Poppleton, Giulia Pedrielli, Petr Šulc and Dimitri P. Bertsekas

Features Selection as a Nash-Bargaining Solution: Applications in Online Advertising and Information Systems pp. 2485-2501

Kimia Keshanian, Daniel Zantedeschi and Kaushik Dutta

Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers pp. 2502-2522

Jan Gmys

An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion pp. 2523-2539

Wei Wu, Manuel Iori, Silvano Martello and Mutsunori Yagiura

Play Like the Pros? Solving the Game of Darts as a Dynamic Zero-Sum Game pp. 2540-2551

Martin B. Haugh and Chun Wang

Improving Variable Orderings of Approximate Decision Diagrams Using Reinforcement Learning pp. 2552-2570

Quentin Cappart, David Bergman, Louis-Martin Rousseau, Isabeau Prémont-Schwarz and Augustin Parjadis

Network Design with Service Requirements: Scaling-up the Size of Solvable Problems pp. 2571-2582

Naga V. C. Gudapati, Enrico Malaguti and Michele Monaci

Optimal Frameworks for Detecting Anomalies in Sensor-Intensive Heterogeneous Networks pp. 2583-2610

Ramin Moghaddass and Yongtao Guan

FrankWolfe.jl: A High-Performance and Flexible Toolbox for Frank–Wolfe Algorithms and Conditional Gradients pp. 2611-2620

Mathieu Besançon, Alejandro Carderera and Sebastian Pokutta

Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion pp. 2621-2633

Amir Ahmadi-Javid and Pooya Hoseinpour

A Branch-and-Cut Algorithm for Submodular Interdiction Games pp. 2634-2657

Kübra Tanınmış and Markus Sinnl

A Catalog of Formulations for the Network Pricing Problem pp. 2658-2674

Quang Minh Bui, Bernard Gendron and Margarida Carvalho

Constant Approximation for the Lifetime Scheduling Problem of p -Percent Coverage pp. 2675-2685

Zhao Zhang, Wei Liang, Hongmin W. Du and Siwen Liu

Solving Natural Conic Formulations with Hypatia.jl pp. 2686-2699

Chris Coey, Lea Kapelevich and Juan Pablo Vielma

Stochastic RWA and Lightpath Rerouting in WDM Networks pp. 2700-2719

Maryam Daryalal and Merve Bodur

Decomposition and Adaptive Sampling for Data-Driven Inverse Linear Optimization pp. 2720-2735

Rishabh Gupta and Qi Zhang

Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems pp. 2736-2753

Daniel Porumbel

A Software Package and Data Set for the Personal Protective Equipment Matching Problem During COVID-19 pp. 2754-2761

Michele Samorani, Ram Bala, Rohit Jacob and Shuhan He

L 0 -Regularized Learning for High-Dimensional Additive Hazards Regression pp. 2762-2775

Zemin Zheng, Jie Zhang and Yang Li

Robust Stochastic Facility Location: Sensitivity Analysis and Exact Solution pp. 2776-2803

Tianqi Liu, Francisco Saldanha-da-Gama, Shuming Wang and Yuchen Mao

A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm pp. 2804-2827

Kiho Seo, Seulgi Joung, Chungmok Lee and Sungsoo Park

Managing Product Transitions: A Bilevel Programming Approach pp. 2828-2844

Rahman Khorramfar, Osman Y. Özaltın, Karl G. Kempf and Reha Uzsoy

A Simulation Optimization Approach for the Appointment Scheduling Problem with Decision-Dependent Uncertainties pp. 2845-2865

Tito Homem- de-Mello, Qingxia Kong and Rodrigo Godoy-Barba

Volume 34, issue 4, 2022

Note from the Editor pp. 1841-1841

Alice E. Smith

VeRoViz: A Vehicle Routing Visualization Toolkit pp. 1842-1848

Lan Peng and Chase Murray

An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs pp. 1849-1870

Zachary Steever, Chase Murray, Junsong Yuan, Mark Karwan and Marco Lübbecke

Dynamic Relaxations for Online Bipartite Matching pp. 1871-1884

Alfredo Torrico and Alejandro Toriello

Efficient Stochastic Programming in Julia pp. 1885-1902

Martin Biel and Mikael Johansson

A New Scenario Reduction Method Based on Higher-Order Moments pp. 1903-1918

Weiguo Zhang and Xiaolei He

A Nested Cross Decomposition Algorithm for Power System Capacity Expansion with Multiscale Uncertainties pp. 1919-1939

Zhouchun Huang, Qipeng P. Zheng and Andrew L. Liu

Inductive Representation Learning on Dynamic Stock Co-Movement Graphs for Stock Predictions pp. 1940-1957

Hu Tian, Xiaolong Zheng, Kang Zhao, Maggie Wenjing Liu and Daniel Dajun Zeng

Distinguishing Homophily from Peer Influence Through Network Representation Learning pp. 1958-1969

Xi Chen, Yan Liu and Cheng Zhang

Exact Solution Algorithms for the Chordless Cycle Problem pp. 1970-1986

Dilson Lucas Pereira, Abilio Lucena, Alexandre Salles da Cunha and Luidi Simonetti

Exact Algorithms for Maximum Lifetime Data-Gathering Tree in Wireless Sensor Networks pp. 1987-2002

Marco Casazza and Alberto Ceselli

The Capacitated and Economic Districting Problem pp. 2003-2016

Luis Henrique Pauleti Mendes, Fábio Luiz Usberti and Celso Cavellucci

Robust Direct Aperture Optimization for Radiation Therapy Treatment Planning pp. 2017-2038

Danielle A. Ripsman, Thomas G. Purdie, Timothy C. Y. Chan and Houra Mahmoudzadeh

A Machine Learning–Enabled Partially Observable Markov Decision Process Framework for Early Sepsis Prediction pp. 2039-2057

Zeyu Liu, Anahita Khojandi, Xueping Li, Akram Mohammed, Robert L Davis and Rishikesan Kamaleswaran

Target-Oriented Distributionally Robust Optimization and Its Applications to Surgery Allocation pp. 2058-2072

Vincent Tsz Fai Chow, Zheng Cui and Daniel Zhuoyu Long

Variable Bound Tightening and Valid Constraints for Multiperiod Blending pp. 2073-2090

Yifu Chen and Christos T. Maravelias

Convex Maximization via Adjustable Robust Optimization pp. 2091-2105

Aras Selvi, Aharon Ben-Tal, Ruud Brekelmans and Dick den Hertog

Adaptive Bundle Methods for Nonlinear Robust Optimization pp. 2106-2124

Martina Kuchlbauer, Frauke Liers and Michael Stingl

A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP pp. 2125-2143

Naomi Graham, Hao Hu, Jiyoung Im, Xinxin Li and Henry Wolkowicz

SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering pp. 2144-2162

Veronica Piccialli, Antonio M. Sudoso and Angelika Wiegele

Computing Optimized Path Integrals for Knapsack Feasibility pp. 2163-2176

Endric Daues and Ulf Friedrich

Logic-Based Benders Decomposition for Integrated Process Configuration and Production Planning Problems pp. 2177-2191

Karim Pérez Martínez, Yossiri Adulyasak and Raf Jans

Branch-and-Price Approaches for Real-Time Vehicle Routing with Picking, Loading, and Soft Time Windows pp. 2192-2211

Martin Wölck and Stephan Meisel

Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions pp. 2212-2228

Ayşe N. Arslan, Michael Poss and Marco Silva

Online Mixed-Integer Optimization in Milliseconds pp. 2229-2248

Dimitris Bertsimas and Bartolomeo Stellato

Bin Packing Problem with Time Lags pp. 2249-2270

Orlando Rivera Letelier, François Clautiaux and Ruslan Sadykov

Decision Diagrams for Discrete Optimization: A Survey of Recent Advances pp. 2271-2295

Margarita P. Castro, Andre A. Cire and J. Christopher Beck

A Scalable Lower Bound for the Worst-Case Relay Attack Problem on the Transmission Grid pp. 2296-2312

Emma S. Johnson and Santanu Subhas Dey

Integral Column Generation for Set Partitioning Problems with Side Constraints pp. 2313-2331

Adil Tahir, Guy Desaulniers and Issmail El Hallaoui

On Generating Lagrangian Cuts for Two-Stage Stochastic Integer Programs pp. 2332-2349

Rui Chen and James Luedtke

Robust Simulation with Likelihood-Ratio Constrained Input Uncertainty pp. 2350-2367

Zhaolin Hu and L. Jeff Hong

Reducing and Calibrating for Input Model Bias in Computer Simulation pp. 2368-2382

Lucy E. Morgan, Luke Rhodes-Leader and Russell R. Barton

Volume 34, issue 3, 2022

Note from the Editor pp. 1305-1305

Alice E. Smith

Unforeseen Consequences of “Tabu” Choices—A Retrospective pp. 1306-1308

Fred W. Glover

Solving the Distance-Based Critical Node Problem pp. 1309-1326

Hosseinali Salemi and Austin Buchanan

Extended Graph Formulation for the Inequity Aversion Pricing Problem on Social Networks pp. 1327-1344

Sunil Chopra, Hyunwoo Park and Sangho Shim

Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem pp. 1345-1365

S. Raghavan and Rui Zhang

A Nonconvex Optimization Approach to IMRT Planning with Dose–Volume Constraints pp. 1366-1386

Kelsey Maass, Minsun Kim and Aleksandr Aravkin

On a Reduction for a Class of Resource Allocation Problems pp. 1387-1402

Martijn H. H. Schoot Uiterkamp, Marco E. T. Gerards and Johann L. Hurink

An Interior-Point Differentiable Path-Following Method to Compute Stationary Equilibria in Stochastic Games pp. 1403-1418

Chuangyin Dang, P. Jean-Jacques Herings and Peixuan Li

Learning-Based Branch-and-Price Algorithms for the Vehicle Routing Problem with Time Windows and Two-Dimensional Loading Constraints pp. 1419-1436

Xiangyi Zhang, Lu Chen, Michel Gendreau and André Langevin

A General Framework for Approximating Min Sum Ordering Problems pp. 1437-1452

Felix Happach, Lisa Hellerstein and Thomas Lidbetter

A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs pp. 1453-1470

Vahid Mahmoodian, Iman Dayarian, Payman Ghasemi Saghand, Yu Zhang and Hadi Charkhgard

Inverse Mixed Integer Optimization: Polyhedral Insights and Trust Region Methods pp. 1471-1488

Merve Bodur, Timothy C. Y. Chan and Ian Yihang Zhu

A Scalable Algorithm for Sparse Portfolio Selection pp. 1489-1511

Dimitris Bertsimas and Ryan Cory-Wright

Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling pp. 1512-1530

Artur Alves Pessoa, Teobaldo Bulhões, Vitor Nesello and Anand Subramanian

Building Load Control Using Distributionally Robust Chance-Constrained Programs with Right-Hand Side Uncertainty and the Risk-Adjustable Variants pp. 1531-1547

Yiling Zhang and Jin Dong

A General Branch-and-Cut Framework for Rotating Workforce Scheduling pp. 1548-1564

Tristan Becker, Maximilian Schiffer and Grit Walther

Unsupervised Learning for Human Mobility Behaviors pp. 1565-1586

Siyuan Liu, Shaojie Tang, Jiangchuan Zheng and Lionel M. Ni

Efficient Algebraic Multigrid Methods for Multilevel Overlapping Coclustering of User-Item Relationships pp. 1587-1605

Haifeng Xu, Rasha F. Kashef, Hans De Sterck and Geoffrey Sanders

On the Estimation of Discrete Choice Models to Capture Irrational Customer Behaviors pp. 1606-1625

Sanjay Dominik Jena, Andrea Lodi and Claudio Sole

Causal Rule Sets for Identifying Subgroups with Enhanced Treatment Effects pp. 1626-1643

Tong Wang and Cynthia Rudin

Improving Sales Forecasting Accuracy: A Tensor Factorization Approach with Demand Awareness pp. 1644-1660

Xuan Bi, Gediminas Adomavicius, William Li and Annie Qu

Uncovering Characteristic Response Paths of a Population pp. 1661-1680

Yicheng Song, Nachiketa Sahoo, Shuba Srinivasan and Chrysanthos Dellarocas

MAD Dispersion Measure Makes Extremal Queue Analysis Simple pp. 1681-1692

Wouter van Eekelen, Dick den Hertog and Johan S.H. van Leeuwaarden

Algorithms for Queueing Systems with Reneging and Priorities Modeled as Quasi-Birth-Death Processes pp. 1693-1710

Amir Rastpour, Armann Ingolfsson and Burhaneddin Sandıkçı

Posterior-Based Stopping Rules for Bayesian Ranking-and-Selection Procedures pp. 1711-1728

David J. Eckman and Shane G. Henderson

Monte Carlo and Quasi–Monte Carlo Density Estimation via Conditioning pp. 1729-1748

Pierre L’Ecuyer, Florian Puchhammer and Amal Ben Abdellah

Benders Subproblem Decomposition for Bilevel Problems with Convex Follower pp. 1749-1767

Geunyeong Byeon and Pascal Van Hentenryck

Computationally Efficient Approximations for Distributionally Robust Optimization Under Moment and Wasserstein Ambiguity pp. 1768-1794

Meysam Cheramin, Jianqiang Cheng, Ruiwei Jiang and Kai Pan

Risk-Averse Stochastic Programming vs. Adaptive Robust Optimization: A Virtual Power Plant Application pp. 1795-1818

Ricardo M. Lima, Antonio J. Conejo, Loïc Giraldi, Olivier Le Maître, Ibrahim Hoteit and Omar M. Knio

Integrated Stochastic Optimal Self-Scheduling for Two-Settlement Electricity Markets pp. 1819-1840

Kai Pan and Yongpei Guan

Volume 34, issue 2, 2022

Note from the Editor pp. 671-671

Alice E. Smith

MathOptInterface: A Data Structure for Mathematical Optimization Problems pp. 672-689

Benoît Legat, Oscar Dowson, Joaquim Dias Garcia and Miles Lubin

Optimal Power Flow in Distribution Networks Under N – 1 Disruptions: A Multistage Stochastic Programming Approach pp. 690-709

Haoxiang Yang and Harsha Nagarajan

Influence Maximization with Latency Requirements on Social Networks pp. 710-728

S. Raghavan and Rui Zhang

Distributionally Robust Optimization Under a Decision-Dependent Ambiguity Set with Applications to Machine Scheduling and Humanitarian Logistics pp. 729-751

Nilay Noyan, Gábor Rudolf and Miguel Lejeune

Practical Nonparametric Sampling Strategies for Quantile-Based Ordinal Optimization pp. 752-768

Dongwook Shin, Mark Broadie and Assaf Zeevi

Iterative Prediction-and-Optimization for E-Logistics Distribution Network Design pp. 769-789

Junming Liu, Weiwei Chen, Jingyuan Yang, Hui Xiong and Can Chen

SHEDR: An End-to-End Deep Neural Event Detection and Recommendation Framework for Hyperlocal News Using Social Media pp. 790-806

Yuheng Hu and Yili Hong

JANOS: An Integrated Predictive and Prescriptive Modeling Framework pp. 807-816

David Bergman, Teng Huang, Philip Brooks, Andrea Lodi and Arvind U. Raghunathan

A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets pp. 817-833

Xinyun Wu, Zhipeng Lü and Fred Glover

Scalable Vertiport Hub Location Selection for Air Taxi Operations in a Metropolitan Region pp. 834-856

Liting Chen, Sebastian Wandelt, Weibin Dai and Xiaoqian Sun

Decomposition-Based Approaches for a Class of Two-Stage Robust Binary Optimization Problems pp. 857-871

Ayşe N. Arslan and Boris Detienne

On the Exact Solution of Prize-Collecting Steiner Tree Problems pp. 872-889

Daniel Rehfeldt and Thorsten Koch

A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games pp. 890-908

Claudio Contardo and Jorge A. Sefair

Branch-and-Bound for Biobjective Mixed-Integer Linear Programming pp. 909-933

Nathan Adelgren and Akshay Gupte

Estimating the Size of Branch-and-Bound Trees pp. 934-952

Gregor Hendel, Daniel Anderson, Pierre Le Bodic and Marc E. Pfetsch

Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization pp. 953-973

Miao Yu, Viswanath Nagarajan and Siqian Shen

Iterative Deepening Dynamically Improved Bounds Bidirectional Search pp. 974-989

John A. Pavlik, Edward C. Sewell and Sheldon H. Jacobson

Network Models for Multiobjective Discrete Optimization pp. 990-1005

David Bergman, Merve Bodur, Carlos Cardonha and Andre A. Cire

Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming pp. 1006-1023

Stefano Coniglio and Stefano Gualandi

Combining Polyhedral Approaches and Stochastic Dual Dynamic Integer Programming for Solving the Uncapacitated Lot-Sizing Problem Under Uncertainty pp. 1024-1041

Franco Quezada, Céline Gicquel and Safia Kedad-Sidhoum

A Comparison of Two Mixed-Integer Linear Programs for Piecewise Linear Function Fitting pp. 1042-1047

John Alasdair Warwicker and Steffen Rebennack

Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem pp. 1048-1069

Yantong Li, Jean-François Côté, Leandro Callegari-Coelho and Peng Wu

Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation pp. 1070-1085

Saharnaz Mehrani, Carlos Cardonha and David Bergman

Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems pp. 1086-1114

Edward Yuhang He, Natashia Boland, George Nemhauser and Martin Savelsbergh

An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix pp. 1115-1125

Riley Badenbroek and Etienne de Klerk

A First-Order Optimization Algorithm for Statistical Learning with Hierarchical Sparsity Structure pp. 1126-1140

Dewei Zhang, Yin Liu and Sam Davanloo Tajbakhsh

Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows pp. 1141-1156

Luciano Costa, Claudio Contardo, Guy Desaulniers and Julian Yarkony

Exact Branch-Price-and-Cut for a Hospital Therapist Scheduling Problem with Flexible Service Locations and Time-Dependent Location Capacity pp. 1157-1175

Alexander Jungwirth, Guy Desaulniers, Markus Frey and Rainer Kolisch

Dynamic Programming for Response-Adaptive Dose-Finding Clinical Trials pp. 1176-1190

Amir Ali Nasrollahzadeh and Amin Khademi

Recourse in Kidney Exchange Programs pp. 1191-1206

Bart Smeulders, Valentin Bartier, Yves Crama and Frits C. R. Spieksma

Surgery Sequencing Coordination with Recovery Resource Constraints pp. 1207-1223

Miao Bai, Robert H. Storer and Gregory L. Tonkay

Managing Advance Admission Requests for Obstetric Care pp. 1224-1239

Na Geng and Xiaolan Xie

Scalable Optimization Methods for Incorporating Spatiotemporal Fractionation into Intensity-Modulated Radiotherapy Planning pp. 1240-1256

Ali Adibi and Ehsan Salari

Toward Robust Monitoring of Malicious Outbreaks pp. 1257-1271

Shaojie Tang, Siyuan Liu, Xu Han and Yu Qiao

Efficient Solution Methods for a General r -Interdiction Median Problem with Fortification pp. 1272-1290

Kaike Zhang, Xueping Li and Mingzhou Jin

Periodic Event Scheduling for Automated Production Systems pp. 1291-1304

Christoph Helmberg, Tobias Hofmann and David Wenzel

Volume 34, issue 1, 2022

Note from the Editor pp. 1-1

Alice E. Smith

Special Issue of INFORMS Journal on Computing —Scalable Reinforcement Learning Algorithms pp. 2-3

J. Paul Brooks, Ted Ralphs and Nicola Secomandi

Spatiotemporal Data Set for Out-of-Hospital Cardiac Arrests pp. 4-10

Janiele E. S. C. Custodio and Miguel Lejeune

Alfonso: Matlab Package for Nonsymmetric Conic Optimization pp. 11-19

Dávid Papp and Sercan Yıldız

Performance Approximation for Time-Dependent Queues with Generally Distributed Abandonments pp. 20-38

Gregor Selinka, Raik Stolletz and Thomas I. Maindl

Self-Learning Threshold-Based Load Balancing pp. 39-54

Diego Goldsztajn, Sem C. Borst, Johan S. H. van Leeuwaarden, Debankur Mukherjee and Philip A. Whiting

Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments pp. 55-75

Matthias Bentert, René van Bevern, André Nichterlein, Rolf Niedermeier and Pavel V. Smirnov

An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem pp. 76-92

Yannick Kergosien, Antoine Giret, Emmanuel Néron and Gaël Sauvanet

The Star Degree Centrality Problem: A Decomposition Approach pp. 93-112

Mustafa C. Camur, Thomas Sharkey and Chrysafis Vogiatzis

An Analytic Framework for Effective Public Health Program Design Using Correctional Facilities pp. 113-128

Ozgur M. Araz, Mayteé Cruz-Aponte, Fernando A. Wilson, Brock W. Hanisch and Ruth S. Margalit

Integrated Multiresource Capacity Planning and Multitype Patient Scheduling pp. 129-149

Liping Zhou, Na Geng, Zhibin Jiang and Shan Jiang

Optimal Screening of Populations with Heterogeneous Risk Profiles Under the Availability of Multiple Tests pp. 150-164

Hrayer Aprahamian and Hadi El-Amine

Min-Max Optimal Design of Two-Armed Trials with Side Information pp. 165-182

Qiong Zhang, Amin Khademi and Yongjia Song

A High-Fidelity Model to Predict Length of Stay in the Neonatal Intensive Care Unit pp. 183-195

Kanix Wang, Walid Hussain, John Birge, Michael D. Schreiber and Daniel Adelman

Robust Optimization for Models with Uncertain Second-Order Cone and Semidefinite Programming Constraints pp. 196-210

Jianzhe Zhen, Frans J. C. T. de Ruiter, Ernst Roos and Dick den Hertog

Extending the Scope of Robust Quadratic Optimization pp. 211-226

Ahmadreza Marandi, Aharon Ben-Tal, Dick den Hertog and Bertrand Melenberg

Predicting Tactical Solutions to Operational Planning Problems Under Imperfect Information pp. 227-242

Eric Larsen, Sébastien Lachapelle, Yoshua Bengio, Emma Frejinger, Simon Lacoste-Julien and Andrea Lodi

Radius of Robust Feasibility for Mixed-Integer Problems pp. 243-261

Frauke Liers, Lars Schewe and Johannes Thürauf

Team Orienteering with Time-Varying Profit pp. 262-280

Qinxiao Yu, Yossiri Adulyasak, Louis-Martin Rousseau, Ning Zhu and Shoufeng Ma

Exact and Approximation Algorithms for the Expanding Search Problem pp. 281-296

Ben Hermans, Roel Leus and Jannik Matuschke

Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems pp. 297-314

Moira MacNeil and Merve Bodur

Solving the Type-2 Assembly Line Balancing with Setups Using Logic-Based Benders Decomposition pp. 315-332

Hassan Zohali, Bahman Naderi and Vahid Roshanaei

The Value of Randomized Solutions in Mixed-Integer Distributionally Robust Optimization Problems pp. 333-353

Erick Delage and Ahmed Saif

State-Variable Modeling for a Class of Two-Stage Stochastic Optimization Problems pp. 354-369

Hossein Hashemi Doulabi, Shabbir Ahmed and George Nemhauser

Combinatorial Heuristics for Inventory Routing Problems pp. 370-384

Ziye Tang, Yang Jiao and R. Ravi

Predictive Search for Capacitated Multi-Item Lot Sizing Problems pp. 385-406

Tao Wu

A General Model and Efficient Algorithms for Reliable Facility Location Problem Under Uncertain Disruptions pp. 407-426

Yongzhen Li, Xueping Li, Jia Shu, Miao Song and Kaike Zhang

Template-Based Minor Embedding for Adiabatic Quantum Optimization pp. 427-439

Thiago Serra, Teng Huang, Arvind U. Raghunathan and David Bergman

Picker Routing in AGV-Assisted Order Picking Systems pp. 440-462

Maximilian Löffler, Nils Boysen and Michael Schneider

Learning for Constrained Optimization: Identifying Optimal Active Constraint Sets pp. 463-480

Sidhant Misra, Line Roald and Yeesian Ng

On Cluster-Aware Supervised Learning: Frameworks, Convergent Algorithms, and Applications pp. 481-502

Shutong Chen and Weijun Xie

Improving Reliability Estimation for Individual Numeric Predictions: A Machine Learning Approach pp. 503-521

Gediminas Adomavicius and Yaqiong Wang

Analyzing Firm Reports for Volatility Prediction: A Knowledge-Driven Text-Embedding Approach pp. 522-540

Yi Yang, Kunpeng Zhang and Yangyang Fan

Detecting Product Adoption Intentions via Multiview Deep Learning pp. 541-556

Zhu Zhang, Xuan Wei, Xiaolong Zheng, Qiudan Li and Daniel Dajun Zeng

Dynamic Sampling Allocation Under Finite Simulation Budget for Feasibility Determination pp. 557-568

Zhongshun Shi, Yijie Peng, Leyuan Shi, Chun-Hung Chen and Michael C. Fu

A Multilevel Simulation Optimization Approach for Quantile Functions pp. 569-585

Songhao Wang, Szu Hui Ng and William Benjamin Haskell

Speeding Up Paulson’s Procedure for Large-Scale Problems Using Parallel Computing pp. 586-606

Ying Zhong, Shaoxuan Liu, Jun Luo and L. Jeff Hong

Statistical Tests for Cross-Validation of Kriging Models pp. 607-621

Jack Kleijnen and Wim C. M. van Beers

Combined Global and Local Search for Optimization with Gaussian Process Models pp. 622-637

Qun Meng, Songhao Wang and Szu Hui Ng

A New Likelihood Ratio Method for Training Artificial Neural Networks pp. 638-655

Yijie Peng, Li Xiao, Bernd Heidergott, L. Jeff Hong and Henry Lam

The Maximum k -Colorable Subgraph Problem and Related Problems pp. 656-669

Olga Kuryatnikova, Renata Sotirov and Juan C. Vera