Journal: INFORMS Journal on Computing

Volume 38, Issue 3

0 -- 0. Editorial Board
693 -- 709Claudia Archetti, Martina Cerulli, Carmine Sorgente. Branch-and-Cut Algorithms for Colorful Components Problems
710 -- 728Mike Hewitt, Fabien Lehuédé. The Freight Transportation Network Scheduling Problem: An Integer Programming-Based Column Generation Algorithm
729 -- 744Dahye Han, Nan Jiang, Santanu S. Dey, Weijun Xie 0001. Regularized MIP Model for Integrating Energy Storage Systems and Its Application for Solving a Trilevel Interdiction Problem
745 -- 765Kai Jungel, Axel Parmentier, Maximilian Schiffer, Thibaut Vidal. Learning-Based Online Optimization for Autonomous Mobility-on-Demand Fleet Control
766 -- 782Tong Wang 0011, Jingyi Yang, Yunyi Li, Boxiang Wang. PIE - Partially Interpretable Estimators with Refinement
783 -- 801Kang Yang, Guopeng Song, Rui Wang 0017, Haoxiang Yang, Roel Leus. Perspective Benders Decomposition with Applications to Fixed-Charge Nonlinear Resource Allocation
802 -- 828Caglar Caglayan, Turgay Ayer, Donatus U. Ekwueme. Assessing Multimodality Breast Cancer Screening Strategies for BRCA1/2 Gene Mutation Carriers and Other High-Risk Populations
829 -- 843Pengfei He, Jin-Kao Hao, Qinghua Wu 0002. A Hybrid Genetic Algorithm with Multi-Population for Capacitated Location Routing
844 -- 861Julia Wahlen, Timo Gschwind. Branch-and-Price for the Set-Union Bin Packing Problem
862 -- 877Lian Duan, Wenjun Zhou 0001, Yong Hu 0002, Lida Xu, Mei Liu. Early Detection of Adverse Drug Reactions in Postmarket Monitoring
878 -- 904Claudio Gentile, Giovanni Rinaldi, Esteban Salgado. SSS Algorithms for Max-Cut
905 -- 920Antonio Maria Sudoso, Daniel Aloise. A Column Generation Algorithm with Dynamic Constraint Aggregation for Minimum Sum-of-Squares Clustering
921 -- 942Cheng Guo 0013, Harsha Nagarajan, Merve Bodur. Tightening Quadratic Convex Relaxations for the Alternating Current Optimal Transmission Switching Problem
943 -- 957Haobo Qi, Feifei Wang, Hansheng Wang 0002. Privacy Protection and Statistical Efficiency Trade-Off for Federated Learning
958 -- 981Rolf Nelson van Lieshout, Thomas van der Schaft. Dynamic Discretization Discovery for the Multidepot Vehicle Scheduling Problem with Trip Shifting
982 -- 997Ruipeng Dong, Canhong Wen. Fast Association Recovery in High Dimensions by Parallel Learning
998 -- 1015Sergey S. Ketkov, Oleg A. Prokopyev. On a Class of Interdiction Problems with Partition Matroids: Complexity and Polynomial-Time Algorithms
1016 -- 1031Mathijs Barkel, Maxence Delorme, Enrico Malaguti, Michele Monaci. Pseudo-Polynomial Formulations for the Bin Packing Problem with Minimum Color Fragmentation

Volume 38, Issue 2

0 -- 0Andrea Lodi 0001. Note from the Editor
0 -- 0. Editorial Board
341 -- 356John Gunnar Carlsson, Julien Yu. A New Upper Bound for the Euclidean TSP Constant
357 -- 376Marwan Shams Eddin, Hadi El Amine, Hrayer Aprahamian. Optimal System Adjustment Under Operational Constraints with Applications to Infectious Disease Screening
377 -- 396Vincent Chau, Christoph Damerius, Peter Kling, Minming Li, Florian Schneider 0001, Ruilong Zhang 0001. Scheduling with Calibrations for Multi-Interval Jobs
397 -- 413Guodong Yu, Pengcheng Dong, Huiping Sun. Refined Wasserstein Distributionally Robust Optimization for Contract Pricing: The Value of Optimality Conditions in Transactions
414 -- 423Alexander Hoen, Dominik Kamp, Ambros M. Gleixner. MIP-DD: Delta Debugging for Mixed-Integer Programming Solvers
424 -- 446Daniel B. Lopes da Silva, Thomas C. Sharkey, Yongjia Song. A Bilevel Network Interdiction Problem to Minimize the Number of Active Special Arcs in the Maximum Flow
447 -- 462Rick S. H. Willemsen, Carlo Cavicchia, Wilco van den Heuvel, Michel van de Velden. An Exact Solution Approach for Hierarchical Clustering
463 -- 489Tao Wu 0004, Weiwei Chen 0003, Jean-François Cordeau, Raf Jans. Machine Learning-Empowered Benders Decomposition for Flow Hub Location in E-Commerce
490 -- 506Lei Guo, Haian Yin, Jin Zhang. A Penalized Sequential Convex Programming Approach for Continuous Network Design Problems
507 -- 530Jiateng Yin, Lixing Yang, Zhe Liang, Andrea D'Ariano, ZiYou Gao. Real-Time Rolling Stock and Timetable Rescheduling in Urban Rail Transit Systems
531 -- 547Yi He, Yi Yang 0042, Defu Lian, Kunpeng Zhang 0001. Divide and Contrast: A Text-Based Method for Firm Market Risk Prediction
548 -- 567Quang Minh Bui, Margarida Carvalho, José Neto 0001. Solving Combinatorial Pricing Problems Using Embedded Dynamic Programming Models
568 -- 589Shiyi Jiang, Jianqiang Cheng, Kai Pan, Boshi Yang. Asymptotically Tight MILP Approximations for a Nonconvex QCP
590 -- 604Neelay Junnarkar, Can Kizilkale, Nevena Golubovic, Murat Arcak, Aydin Buluç. Sempervirens: A Fast Reconstruction Algorithm for Noisy and Incomplete Binary Matrix Representations of Trees
605 -- 624Maria Bazotte, Margarida Carvalho, Thibaut Vidal. Solving Two-Stage Programs with Endogenous Uncertainty via Random Variable Transformation
625 -- 644Shoumeng Ge, Ying Chen. Two-Stage Dynamic Fusion Framework for Multimodal Classification Tasks
645 -- 675Thomas Hübner, Akshay Gupte, Steffen Rebennack. Spatial Branch-and-Bound for Nonconvex Separable Piecewise Linear Optimization
676 -- 691Jiarong Xu, Jiaan Wang, Zenan Zhou, Tian Lu 0002. Toward Graph Data Collaboration in a Data-Sharing-Free Manner: A Novel Privacy-Preserving Graph Pretraining Model

Volume 38, Issue 1

0 -- 0. Editorial Board
0 -- 0Alice E. Smith. Note from the Editor
0 -- 0Alice E. Smith. Reviewer Appreciation 2025
1 -- 15Li Yu 0002, Wei Gong, Dongsong Zhang, Yu Ding, Zhe Fu. From Interaction to Prediction: A Multi-Interactive Attention-Based Approach to Product Rating Prediction
16 -- 38Malena Schmidt, Bismark Singh. The Balanced Facility Location Problem: Complexity and Heuristics
39 -- 52Roberto Bargetto, Federico Della Croce, Rosario Scatamacchia. Iterated Inside Out: A New Exact Algorithm for the Transportation Problem
53 -- 66Prachi Shah, Santanu S. Dey, Marco Molinaro 0001. Non-Monotonicity of Branching Rules with Respect to Linear Relaxations
67 -- 85Swati Gupta 0001, Cyrus Hettle, Daniel K. Molzahn. Fair and Reliable Reconnections for Temporary Disruptions in Electric Distribution Networks
86 -- 101Yuzhuo Qiu, Mikhail Cherniavskii, Boris Goldengorin, Panos M. Pardalos. A Computational Study of the Tool Replacement Problem
102 -- 125Jaegwan Joo, Chungmok Lee. A Branch-and-Price Algorithm for Robust Drone-Vehicle Routing Problem with Time Windows
126 -- 149Kayla S. Cummings, Alexandre Jacquillat, Vikrant Vaze. Activated Benders Decomposition for Day-Ahead Paratransit Itinerary Planning
150 -- 164Weibo Lin, Zhu He, Shibiao Jiang, Fuda Ma, Zhouxing Su, Zhipeng Lü. Alkaid-SDVRP: An Efficient Open-Source Solver for the Vehicle Routing Problem with Split Deliveries
165 -- 188Yasmine Beck, Ivana Ljubic, Martin Schmidt 0003. Heuristic Methods for Γ-Robust Mixed-Integer Linear Bilevel Problems
189 -- 206Hsiao-Yu Hu, Hao-Ting Wei, Meng-Hsi Li, Kai-Min Chung, Chung-Shou Liao. Online TSP and Online Dial-a-Ride with Predictions
207 -- 231Hossein Abouee-Mehrizi, Mahdi Mirjalili, Vahid Sarhangian. Platelet Inventory Management with Approximate Dynamic Programming
232 -- 252Jiajie Zhang, Yun-Hui Lin, Gerardo Berbeglia. Approximate Resolution of Stochastic Choice-Based Discrete Planning
253 -- 268Hongtao Wang, Jian Zhou 0003. Cross-Entropy Method for the Maximal Covering Location Problem
269 -- 294Tyler H. Chang, Stefan M. Wild. Designing a Framework for Solving Multiobjective Simulation Optimization Problems
295 -- 314Aida Khajavirad, Yakun Wang. Inference in Higher Order Undirected Graphical Models and Binary Polynomial Optimization
315 -- 339Peng Wang 0098, Rujun Jiang, Qingyuan Kong, Laura Balzano. A Proximal Difference-of-Convex Algorithm for Sample Average Approximation of Chance Constrained Programming