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