


default search action
INFORMS Journal on Computing, Volume 38
Volume 38, Number 1, 2026
- Editorial Board. iii

- Alice E. Smith:

Reviewer Appreciation 2025. iv-xiii - Alice E. Smith:

Note from the Editor. xiv-xvi - Li Yu, Wei Gong, Dongsong Zhang, Yu Ding, Zhe Fu:

From Interaction to Prediction: A Multi-Interactive Attention-Based Approach to Product Rating Prediction. 1-15 - Malena Schmidt, Bismark Singh:

The Balanced Facility Location Problem: Complexity and Heuristics. 16-38 - Roberto Bargetto, Federico Della Croce, Rosario Scatamacchia:

Iterated Inside Out: A New Exact Algorithm for the Transportation Problem. 39-52 - Prachi Shah, Santanu S. Dey, Marco Molinaro:

Non-Monotonicity of Branching Rules with Respect to Linear Relaxations. 53-66 - Swati Gupta, Cyrus Hettle, Daniel K. Molzahn:

Fair and Reliable Reconnections for Temporary Disruptions in Electric Distribution Networks. 67-85 - Yuzhuo Qiu, Mikhail Cherniavskii, Boris Goldengorin, Panos M. Pardalos:

A Computational Study of the Tool Replacement Problem. 86-101 - Jaegwan Joo, Chungmok Lee:

A Branch-and-Price Algorithm for Robust Drone-Vehicle Routing Problem with Time Windows. 102-125 - Kayla S. Cummings, Alexandre Jacquillat, Vikrant Vaze:

Activated Benders Decomposition for Day-Ahead Paratransit Itinerary Planning. 126-149 - Weibo 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. 150-164 - Yasmine Beck, Ivana Ljubic, Martin Schmidt:

Heuristic Methods for Γ-Robust Mixed-Integer Linear Bilevel Problems. 165-188 - Hsiao-Yu Hu, Hao-Ting Wei, Meng-Hsi Li, Kai-Min Chung, Chung-Shou Liao:

Online TSP and Online Dial-a-Ride with Predictions. 189-206 - Hossein Abouee-Mehrizi, Mahdi Mirjalili, Vahid Sarhangian:

Platelet Inventory Management with Approximate Dynamic Programming. 207-231 - Jiajie Zhang, Yun Hui Lin, Gerardo Berbeglia:

Approximate Resolution of Stochastic Choice-Based Discrete Planning. 232-252 - Hongtao Wang, Jian Zhou:

Cross-Entropy Method for the Maximal Covering Location Problem. 253-268 - Tyler H. Chang, Stefan M. Wild:

Designing a Framework for Solving Multiobjective Simulation Optimization Problems. 269-294 - Aida Khajavirad, Yakun Wang:

Inference in Higher Order Undirected Graphical Models and Binary Polynomial Optimization. 295-314 - Peng Wang, Rujun Jiang, Qingyuan Kong, Laura Balzano:

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

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














