CPAIOR 2025

Conference Program

10-13 November 2025 · Melbourne, Australia

Overview (Sessions & Breaks)

Monday, 10 November 2025

From 08:00
Registration • Foyer
10:00–10:30
Coffee/tea break • Foyer
11:30-13:00
Lunch Break
15:00–15:30
Coffee/tea break • Foyer

Tuesday, 11 November 2025

Wednesday, 12 November 2025

From 08:00
Registration • Foyer
10:00–10:30
Coffee/tea break • Foyer
12:00–13:30
Lunch break
15:00–15:30
Coffee/tea break • Foyer

Thursday, 13 November 2025

From 08:00
Registration • Foyer
10:00–10:30
Coffee/tea break • Foyer
12:00–13:30
Lunch break
15:00–15:30
Coffee/tea break • Foyer
16:50–17:00
Closing Remarks

Detailed Program

Monday, 10 November 2025

Registration From 08:00 Foyer
Master Class 08:45-10:00 Forum 3 Chair: Buser Say
08:45-09:00
Opening Remarks
Buser Say (Monash University)
09:00–10:00
CP, AI and OR for Classical Planning (Part 1)
Coffee/tea break 10:00–10:30 Foyer
Master Class 10:30-11:30 Forum 3
10:30–11:30
CP, AI and OR for Classical Planning (Part 2)
Lunch Break 11:30-13:00
Master Class 13:00-15:00 Forum 3 Chair: Buser Say
13:00-15:00
CP, AI and OR for MDP Planning
Coffee/tea break 15:00–15:30 Foyer
Master Class 15:30-17:45 Forum 3 Chair: Buser Say
15:30–17:30
CP, AI and OR for Path Planning
17:30–17:45
Closing Remarks
Buser Say (Monash University)

Tuesday, 11 November 2025

Registration From 08:00 Foyer
Opening Remarks 08:45–09:15 Forum 3 Chair: Guido Tack
Session 1 - Symmetry Breaking and Constraint Acquisition 09:00–10:00 Forum 3
09:00–09:20
Breaking the Symmetries of Indistinguishable Objects
Mun See Chang, Ian P. Gent, Christopher Jefferson
09:20–09:40
Breaking Symmetries from a Set-Covering Perspective
Michael Codish, Mikolas Janota
09:40–10:00
Acquiring and Selecting Implied Constraints with an Application to the BinSeq and Partition Global Constraints
Jovial Cheukam Ngouonou, Ramiz Gindullin, Claude-Guy Quimper, Nicloas Beldiceanu, Rémi Douence
Coffee/tea break 10:00–10:30 Foyer
Session 2 - Invited Talk 10:30–11:30 Forum 3
Session 3 - Extended Abstracts 11:30–11:50 Forum 3
11:30–11:40
Enhancing Beam Search with Machine Learning for Resource-Constrained Shortest Path Reformulation of Combinatorial Optimization Problems
Fulin Yan
11:40–11:50
PINCHD: An Integrated Algorithm for Large-scale Maximum Weighted Independent Set Problems
Linhao Luo, Hue Chi Lam, Vicky Mak-Hau
Lunch break 12:00–13:30
Session 4 - Applications: Scheduling and resource allocation in industry, healthcare, sustainability 13:30–15:00 Forum 3
13:30–13:50
Optimized Scheduling of Medical Appointment Sequences using Constraint Programming
George Assaf, Sven Löffler, Petra Hofstedt
13:50–14:10
An integrated optimisation method for aluminium hot rolling
Ioannis Avgerinos, Apostolos Besis, Ioannis Mourtos, Athanasios Psarros, Stavros Vatikiotis, Georgios Zois
14:10–14:30
Reducing Income Variability in Natural Resource Portfolios via Integer Programming
Laura Greenstreet, Qinru Shi, Marc Grimson, Franz W. Simon, Suresh A. Sethi, Carla P. Gomes, David B. Shmoys
14:30–14:40
Real-Time Surgery Scheduling under Uncertainty: A Markov Decision Process Approach
Hajar Sadegh Zadeh
14:40–14:50
Constraint Optimisation Programming of Frequency-Based Designs for Response Surface Metamodelling
Andrew Gill, David Marlow, Susan M. Sanchez, Paul J. Sanchez
Coffee/tea break 15:00–15:30 Foyer
Session 5 - Reinforcement Learning and Learning Heuristics 15:30–17:00 Forum 3
15:30–15:50
Reinforcement Learning-based Heuristics to Guide Domain-Independent Dynamic Programming
Minori Narita, Ryo Kuroiwa, J. Christopher Beck
15:50–16:10
Shaping Reward Signals in Reinforcement Learning Using Constraint Programming
Chao Yin, Quentin Cappart, Gilles Pesant
16:10–16:30
Learning Primal Heuristics for 0-1 Knapsack Interdiction Problems
Luca Ferrarini, Stefano Gualandi, Letizia Moro, Axel Parmentier
16:30–16:50
Self-Supervised Penalty-Based Learning for Robust Constrained Optimization
Wyame Benslimane, Paul Grigas
16:50–17:00
Constrained Sequential Inference in Machine Learning Using Constraint Programming
Virasone Manibod, David Saikali, Gilles Pesant
Opening Reception 18:00–20:00

Wednesday, 12 November 2025

Registration From 08:00 Foyer
Invited Talk (joint with ICAPS) 09:00–10:00 Forum
Coffee/tea break 10:00–10:30 Foyer
Session 6 - Applications: Satellites and UAVs 10:30–12:00 Forum 3
10:30–10:50
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 Saephan
10:50–11:10
Integer and Constraint Programming for the Offline Nanosatellite Partition Scheduling Problem
Julien Rouzot, Mickaël Pereira, Christian Artigues, Romain Boyer, Frédéric Camps, Philippe Garnier, Emmanuel Hebrard, Pierre Lopez
11:10–11:30
Hybridizing Machine Learning and Optimization for Planning Satellite Observations
Romain Barrault, Cédric Pralet, Gauthier Picard, Eric Sawyer
11:30–11:50
Satellite Communication Resources Management in a Earth Observation Federation of Constellations
Henoïk Willot, Jean-Loup Farges, Gauthier Picard, Philippe Pavero
Lunch break 12:00–13:30
Session 7 - Solving Technology 13:30–15:00 Forum 3
13:30–13:50
Revisiting Pseudo-Boolean Encodings from an Integer Perspective
Hendrik Bierlee, Jip J. Dekker, Peter J. Stuckey
13:50–14:10
Parallelising Lazy Clause Generation with Trail Sharing
Toby O. Davies, Frédéric Didier, Laurent Perron, Peter J. Stuckey
14:10–14:30
Analyzing the numerical correctness of branch-and-bound decisions for mixed-integer programming
Alexander Hoen, Ambros Gleixner
14:30–14:50
Determining the Most Promising Selective Backbone Size for Partial Knowledge Compilation
Andrea Balogh, Guillaume Escamocher, Barry O'Sullivan
Coffee/tea break 15:00–15:30 Foyer
Session 8 - Machine Learning and Mixed Integer Programming 15:30–17:00 Forum 3
15:30–15:50
LLMs for Cold-Start Cutting Plane Separator Configuration
Connor Lawless, Yingxi Li, Anders Wikum, Madeleine Udell, Ellen Vitercik
15:50–16:10
Multi-task Representation Learning for Mixed Integer Linear Programming
Junyang Cai, Taoan Huang, Bistra Dilkina
16:10–16:30
PySCIPOpt-ML: Embedding Trained Machine Learning Models into Mixed-Integer Programs
Mark Turner, Antonia Chmiela, Thorsten Koch, Michael Winkler
16:30–16:50
Constrained Machine Learning Through Hyperspherical Representation
Gaetano Signorelli, Michele Lombardi
16:50–17:00
A Surrogate-Based Multi-Objective Optimization Framework with Uncertainty Consideration
Jesica de Armas
Conference Banquet 18:30–23:00 Old Melbourne Gaol

Thursday, 13 November 2025

Registration From 08:00 Foyer
Invited Talk (joint with ICAPS) 09:00–10:00 Forum
Coffee/tea break 10:00–10:30 Foyer
Session 9 - Applications: Manufacturing and Laboratory Scheduling 10:30–12:00 Forum 3
10:30–10:50
Modeling and Solving the Generalized Test Laboratory Scheduling Problem
Philipp Danzinger, Tobias Geibinger, Florian Mischek, Nysret Musliu
10:50–11:10
Minimising Source-Plate Swaps for Robotised Compound Dispensing in Microplates
Ramiz Gindullin, Brinton Seashore-Ludlow, Ola Spjuth
11:10–11:30
A Dynamic Programming Approach for the Job Sequencing and Tool Switching Problem
Emma Legrand, Vianney Copp, Daniele Catanzaro, Pierre Schaus
11:30–11:40
A Simplified Model for Marker-Assisted Gene Pyramiding: Minimising Generations and Crossings
Kelvin Davis, Pierre Le Bodic, Andreas T Ernst
11:40–11:50
The Edge-based Contiguous p-median Problem with Connections to Logistics Districting
Adolfo R. Escobedo
Lunch break 12:00–13:30
Session 10 - Applications: Transport and Power Systems 13:30–15:00 Forum 3
13:30–13:50
A Column Generation Heuristic for Multi-depot Electric Bus Scheduling
Yoann Sabatier Montanaro, Thomas Jacquet, Quentin Cappart, Guy Desaulniers
13:50–14:10
Combining Constraint Programming and Metaheuristics for Aircraft Maintenance Routing with a Distribution Objective
Ida Gjergji, Lucas Kletzander, Hendrik Bierlee, Nysret Musliu, Peter J. Stuckey
14:10–14:30
Leveraging Quantum Computing for Accelerated Classical Algorithms in Power Systems Optimization
Rosemary Barrass, Harsha Nagarajan, Carleton Coffrin
14:30–14:50
Dynamic Discretization Discovery for Drone-Assisted Vehicle Routing Problem with Time Windows
Zihan Zhang, Edward Lam, Pierre Le Bodic
14:50–15:00
Constraint-based In-Station Train Dispatching
Andreas Schutt, Matteo Cardellini, Jip J. Dekker, Daniel Harabor, Marco Maratea, Mauro Vallati
Coffee/tea break 15:00–15:30 Foyer
Session 11 - Learning, Algorithm Configuration and MDPs 15:30–17:00 Forum 3
15:30–15:50
Accelerated Discovery of Set Cover Solutions via Graph Neural Networks
Zohair Shafi, Benjamin A. Miller, Tina Eliassi-Rad, Rajmonda S. Caceres
15:50–16:10
On the Efficiency of Algebraic Simplex Algorithms for Solving MDPs
Dibyangshu Mukherjee, Shivaram Kalyanakrishnan
16:10–16:30
Bounded-Error Policy Optimization for Mixed Discrete-Continuous MDPs via Constraint Generation in Nonlinear Programming
Michael Gimelfarb, Ayal Taitler, Scott Sanner
16:30–16:50
Algorithm Configuration in Sequential Decision-Making
Luca Begnardi, Bart von Meijenfeldt, Yingqian Zhang, Willem van Jaarsveld, Hendrik Baier
Closing Remarks 16:50–17:00 Chair: Guido Tack