INFORMS Journal on Computing

2017 - 2026

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 38, issue 3, 2026

Branch-and-Cut Algorithms for Colorful Components Problems pp. 693-709

Claudia Archetti, Martina Cerulli and Carmine Sorgente

The Freight Transportation Network Scheduling Problem: An Integer Programming-Based Column Generation Algorithm pp. 710-728

Mike Hewitt and Fabien Lehuédé

Regularized MIP Model for Integrating Energy Storage Systems and Its Application for Solving a Trilevel Interdiction Problem pp. 729-744

Dahye Han, Nan Jiang, Santanu S. Dey and Weijun Xie

Learning-Based Online Optimization for Autonomous Mobility-on-Demand Fleet Control pp. 745-765

Kai Jungel, Axel Parmentier, Maximilian Schiffer and Thibaut Vidal

PIE—Partially Interpretable Estimators with Refinement pp. 766-782

Tong Wang, Jingyi Yang, Yunyi Li and Boxiang Wang

Perspective Benders Decomposition with Applications to Fixed-Charge Nonlinear Resource Allocation pp. 783-801

Kang Yang, Guopeng Song, Rui Wang, Haoxiang Yang and Roel Leus

Assessing Multimodality Breast Cancer Screening Strategies for BRCA1/2 Gene Mutation Carriers and Other High-Risk Populations pp. 802-828

Çağlar Çağlayan, Turgay Ayer and Donatus U. Ekwueme

A Hybrid Genetic Algorithm with Multi-Population for Capacitated Location Routing pp. 829-843

Pengfei He, Jin-Kao Hao and Qinghua Wu

Branch-and-Price for the Set-Union Bin Packing Problem pp. 844-861

Julia Wahlen and Timo Gschwind

Early Detection of Adverse Drug Reactions in Postmarket Monitoring pp. 862-877

Lian Duan, Wenjun Zhou, Yong Hu, Lida Xu and Mei Liu

SSS Algorithms for Max-Cut pp. 878-904

Claudio Gentile, Giovanni Rinaldi and Esteban Salgado

A Column Generation Algorithm with Dynamic Constraint Aggregation for Minimum Sum-of-Squares Clustering pp. 905-920

Antonio M. Sudoso and Daniel Aloise

Tightening Quadratic Convex Relaxations for the Alternating Current Optimal Transmission Switching Problem pp. 921-942

Cheng Guo, Harsha Nagarajan and Merve Bodur

Privacy Protection and Statistical Efficiency Trade-Off for Federated Learning pp. 943-957

Haobo Qi, Feifei Wang and Hansheng Wang

Dynamic Discretization Discovery for the Multidepot Vehicle Scheduling Problem with Trip Shifting pp. 958-981

Rolf Nelson van Lieshout and Thomas van der Schaft

Fast Association Recovery in High Dimensions by Parallel Learning pp. 982-997

Ruipeng Dong and Canhong Wen

On a Class of Interdiction Problems with Partition Matroids: Complexity and Polynomial-Time Algorithms pp. 998-1015

Sergey S. Ketkov and Oleg A. Prokopyev

Pseudo-Polynomial Formulations for the Bin Packing Problem with Minimum Color Fragmentation pp. 1016-1031

Mathijs Barkel, Maxence Delorme, Enrico Malaguti and Michele Monaci

Volume 38, issue 2, 2026

Note from the Editor pp. iv-iv

Andrea Lodi

A New Upper Bound for the Euclidean TSP Constant pp. 341-356

John Gunnar Carlsson and Julien Yu

Optimal System Adjustment Under Operational Constraints with Applications to Infectious Disease Screening pp. 357-376

Marwan Shams Eddin, Hadi El-Amine and Hrayer Aprahamian

Scheduling with Calibrations for Multi-Interval Jobs pp. 377-396

Vincent Chau, Christoph Damerius, Peter Kling, Minming Li, Florian Schneider and Ruilong Zhang

Refined Wasserstein Distributionally Robust Optimization for Contract Pricing: The Value of Optimality Conditions in Transactions pp. 397-413

Guodong Yu, Pengcheng Dong and Huiping Sun

MIP-DD: Delta Debugging for Mixed-Integer Programming Solvers pp. 414-423

Alexander Hoen, Dominik Kamp and Ambros Gleixner

A Bilevel Network Interdiction Problem to Minimize the Number of Active Special Arcs in the Maximum Flow pp. 424-446

Daniel B. Lopes da Silva, Thomas C. Sharkey and Yongjia Song

An Exact Solution Approach for Hierarchical Clustering pp. 447-462

Rick Willemsen, Carlo Cavicchia, Wilco van den Heuvel and Michel van de Velden

Machine Learning-Empowered Benders Decomposition for Flow Hub Location in E-Commerce pp. 463-489

Tao Wu, Weiwei Chen, Jean-François Cordeau and Raf Jans

A Penalized Sequential Convex Programming Approach for Continuous Network Design Problems pp. 490-506

Lei Guo, Haian Yin and Jin Zhang

Real-Time Rolling Stock and Timetable Rescheduling in Urban Rail Transit Systems pp. 507-530

Jiateng Yin, Lixing Yang, Zhe Liang, Andrea D’Ariano and Ziyou Gao

Divide and Contrast: A Text-Based Method for Firm Market Risk Prediction pp. 531-547

Yi He, Yi Yang, Defu Lian and Kunpeng Zhang

Solving Combinatorial Pricing Problems Using Embedded Dynamic Programming Models pp. 548-567

Quang Minh Bui, Margarida Carvalho and José Neto

Asymptotically Tight MILP Approximations for a Nonconvex QCP pp. 568-589

Shiyi Jiang, Jianqiang Cheng, Kai Pan and Boshi Yang

Sempervirens: A Fast Reconstruction Algorithm for Noisy and Incomplete Binary Matrix Representations of Trees pp. 590-604

Neelay Junnarkar, Can Kızılkale, Nevena Golubovic, Murat Arcak and Aydın Buluç

Solving Two-Stage Programs with Endogenous Uncertainty via Random Variable Transformation pp. 605-624

Maria Bazotte, Margarida Carvalho and Thibaut Vidal

Two-Stage Dynamic Fusion Framework for Multimodal Classification Tasks pp. 625-644

Shoumeng Ge and Ying Chen

Spatial Branch-and-Bound for Nonconvex Separable Piecewise Linear Optimization pp. 645-675

Thomas Hübner, Akshay Gupte and Steffen Rebennack

Toward Graph Data Collaboration in a Data-Sharing-Free Manner: A Novel Privacy-Preserving Graph Pretraining Model pp. 676-691

Jiarong Xu, Jiaan Wang, Zenan Zhou and Tian Lu

Volume 38, issue 1, 2026

Reviewer Appreciation 2025 pp. iv-xiii

Alice E. Smith

Note from the Editor pp. xiv-xvi

Alice E. Smith

From Interaction to Prediction: A Multi-Interactive Attention-Based Approach to Product Rating Prediction pp. 1-15

Li Yu, Wei Gong, Dongsong Zhang, Yu Ding and Zhe Fu

The Balanced Facility Location Problem: Complexity and Heuristics pp. 16-38

Malena Schmidt and Bismark Singh

Iterated Inside Out: A New Exact Algorithm for the Transportation Problem pp. 39-52

Roberto Bargetto, Federico Della Croce and Rosario Scatamacchia

Non-Monotonicity of Branching Rules with Respect to Linear Relaxations pp. 53-66

Prachi Shah, Santanu S. Dey and Marco Molinaro

Fair and Reliable Reconnections for Temporary Disruptions in Electric Distribution Networks pp. 67-85

Swati Gupta, Cyrus Hettle and Daniel Molzahn

A Computational Study of the Tool Replacement Problem pp. 86-101

Yuzhuo Qiu, Mikhail Cherniavskii, Boris Goldengorin and Panos M. Pardalos

A Branch-and-Price Algorithm for Robust Drone-Vehicle Routing Problem with Time Windows pp. 102-125

Jaegwan Joo and Chungmok Lee

Activated Benders Decomposition for Day-Ahead Paratransit Itinerary Planning pp. 126-149

Kayla Cummings, Alexandre Jacquillat and Vikrant Vaze

Alkaid-SDVRP: An Efficient Open-Source Solver for the Vehicle Routing Problem with Split Deliveries pp. 150-164

Weibo Lin, Zhu He, Shibiao Jiang, Fuda Ma, Zhouxing Su and Zhipeng Lü

Heuristic Methods for Γ-Robust Mixed-Integer Linear Bilevel Problems pp. 165-188

Yasmine Beck, Ivana Ljubić and Martin Schmidt

Online TSP and Online Dial-a-Ride with Predictions pp. 189-206

Hsiao-Yu Hu, Hao-Ting Wei, Meng-Hsi Li, Kai-Min Chung and Chung-Shou Liao

Platelet Inventory Management with Approximate Dynamic Programming pp. 207-231

Hossein Abouee-Mehrizi, Mahdi Mirjalili and Vahid Sarhangian

Approximate Resolution of Stochastic Choice-Based Discrete Planning pp. 232-252

Jiajie Zhang, Yun Hui Lin and Gerardo Berbeglia

Cross-Entropy Method for the Maximal Covering Location Problem pp. 253-268

Hongtao Wang and Jian Zhou

Designing a Framework for Solving Multiobjective Simulation Optimization Problems pp. 269-294

Tyler H. Chang and Stefan M. Wild

Inference in Higher Order Undirected Graphical Models and Binary Polynomial Optimization pp. 295-314

Aida Khajavirad and Yakun Wang

A Proximal Difference-of-Convex Algorithm for Sample Average Approximation of Chance Constrained Programming pp. 315-339

Peng Wang, Rujun Jiang, Qingyuan Kong and Laura Balzano