| 2026 | Improving the Planning of Stochastic Tasks with Availability Windows Using Prediction. | Alexis Guigal, Emmanuel Hyon, Claire Hanen |
| 2026 | Transit Network Design with Two-Level Demand Uncertainties: A Machine Learning and Contextual Stochastic Optimization Framework. | Hongzhao Guan, Beste Basciftci, Pascal Van Hentenryck |
| 2026 | Resolution Meets Cutting Planes: Introducing Hypercube Linear Resolution. | Maarten Flippo, Peter J. Stuckey, Emir Demirovic |
| 2026 | Computing Minimax Regret by Bounding the Weight Space From Within and Without. | Guillaume Escamocher, Paolo Viappiani, Nic Wilson |
| 2026 | Clustering for Relaxed and Restricted Decision Diagram Bounds: When It Works and Why. | Alice Burlats, Roger Kameugne, Cristel Pelsser, Pierre Schaus |
| 2026 | Imitation-Guided World Models for Multi-agent Train Rescheduling. | Max Bourgeat, Antoine Legrain, Quentin Cappart |
| 2026 | Learning to Choose Branching Rules for Nonconvex MINLPs. | Timo Berthold, Fritz Geis |
| 2026 | The Theory of Lagrangian Filtering Zones: A Case Study on the Knapsack Constraint. | Frdric Berthiaume, Claude-Guy Quimper |
| 2026 | Generalised Arc Consistency via the Synchronised Product of Finite Automata with Respect to a Constraint. | Nicolas Beldiceanu |
| 2026 | Enhancing Scalability in Distributed Flexible Flowshop Scheduling: A Hybrid RL-CP Approach. | Ioannis Avgerinos, Christos Katrinakis, Andreas Ktenidis, Aggelos Ioannis Lagos, Ioannis Mourtos, Georgios Zois |
| 2026 | corl: Reinforcement Learning of MILP Policies Solved via Branch-and-Bound. | Akhil S. Anand, Elias Aarekol, Martin Mziray Dalseg, Magnus Stlhane, Sebastien Gros |
| 2026 | Backbone-Based Predict and Search for Pseudo-Boolean Optimization. | Bryan Alvarado-Ulloa, Bistra Dilkina, Dorit S. Hochbaum, Ricardo anculef, Roberto Asn-Ach |
| 2025 | Shaping Reward Signals in Reinforcement Learning Using Constraint Programming. | Chao Yin, Quentin Cappart, Gilles Pesant |
| 2025 | Satellite Communication Resources Management in a Earth Observation Federation of Constellations. | Hnok Willot, Jean-Loup Farges, Gauthier Picard, Philippe Pavero |
| 2025 | PySCIPOpt-ML: Embedding Trained Machine Learning Models into Mixed-Integer Programs. | Mark Turner, Antonia Chmiela, Thorsten Koch, Michael Winkler |
| 2025 | Constrained Machine Learning Through Hyperspherical Representation. | Gaetano Signorelli, Michele Lombardi |
| 2025 | Accelerated Discovery of Set Cover Solutions via Graph Neural Networks. | Zohair Shafi, Benjamin A. Miller, Tina Eliassi-Rad, Rajmonda Sulo Caceres |
| 2025 | Integer and Constraint Programming for the Offline Nanosatellite Partition Scheduling Problem. | Julien Rouzot, Mickal Pereira, Christian Artigues, Romain Boyer, Frdric Camps, Philippe Garnier, Emmanuel Hebrard, Pierre Lopez |
| 2025 | Reinforcement Learning-Based Heuristics to Guide Domain-Independent Dynamic Programming. | Minori Narita, Ryo Kuroiwa, J. Christopher Beck |
| 2025 | On the Efficiency of Algebraic Simplex Algorithms for Solving MDPs. | Dibyangshu Mukherjee, Shivaram Kalyanakrishnan |
| 2025 | A Column Generation Heuristic for Multi-depot Electric Bus Scheduling. | Yoann Sabatier Montanaro, Thomas Jacquet, Quentin Cappart, Guy Desaulniers |
| 2025 | Time-Dependent Orienteering for High Altitude UAVs to Monitor Greenhouse Gases: - Mixed Integer Programming vs. Monte Carlo Tree Search. | Richard Levinson, Vinay Ravindra, Jeremy Frank, Meghan Chandarana Saephan |
| 2025 | A Dynamic Programming Approach for the Job Sequencing and Tool Switching Problem. | Emma Legrand, Vianney Copp, Daniele Catanzaro, Pierre Schaus |
| 2025 | LLMs for Cold-Start Cutting Plane Separator Configuration. | Connor Lawless, Yingxi Li, Anders Wikum, Madeleine Udell, Ellen Vitercik |
| 2025 | Analyzing the Numerical Correctness of Branch-and-Bound Decisions for Mixed-Integer Programming. | Alexander Hoen, Ambros M. Gleixner |