CPAIOR
banner
cpaior.bsky.social
CPAIOR
@cpaior.bsky.social
The 22nd International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research November 10 to 13, 2025
And with Guido’s goodbye, we conclude another amazing CPAIOR. Thank you to all the speakers and attendees!
For people who couldn’t attend, we’re hoping to publish talks of the presentations where speakers allow.
November 13, 2025 at 6:00 AM
With the last paper presentation in the program. Luca Begnardi presents their work on algorithmic configuration in sequential decision-making.
doi.org/10.1007/978-...
November 13, 2025 at 5:37 AM
After years in the works, it has finally been published, and we can hear Scott Sanner present his work "Bounded-Error Policy Optimization for Mixed Discrete-Continuous MDPs via Constraint Generation in Nonlinear Programming"
doi.org/10.1007/978-...
November 13, 2025 at 5:11 AM
The next presentation comments on the efficiency of algebraic simplex algorithms for solving MDPs and is presented by Dibyangshu Mukherjee.
doi.org/10.1007/978-...
November 13, 2025 at 4:56 AM
Our final session at CPAIOR contains a varied number of topics: learning, algorithm configuration and MDPs. As a suprise speaker, Bistra Dilkina is presenting the work "Accelerated Discovery of Set Cover Solutions via Graph Neural Networks" as the authors were unavailable.
doi.org/10.1007/978-...
November 13, 2025 at 4:35 AM
Transitioning us into power systems, Rosemary Barrass talks about how quantum computing can be leveraged for accelerating classical algorithms in optimizing power systems.
doi.org/10.1007/978-...
November 13, 2025 at 3:11 AM
From the ground to the sky, Ida Gjergji talks about their method combining constraint programming and meta-heuristics for aircraft maintenance routing with a distribution objective.
doi.org/10.1007/978-...
November 13, 2025 at 2:51 AM
The second application session is all about Transport and Power Systems. We start with a presentation by Thomas Jacquet who guides us through his column generation heuristic for multi-depot electric bus scheduling.
doi.org/10.1007/978-...
November 13, 2025 at 2:33 AM
In the unenviable position of last before lunch, Adolfo R. Escobedo discusses the edge-based contiguous p-median problem with connections to logistics districting.
November 13, 2025 at 12:43 AM
We finish the session with two extended abstract talks. First up is Kelvin Davis to explain how we can get "better food faster" or alternatively: "A Simplified Model for Marker-Assisted Gene Pyramiding: Minimising Generations and Crossings"
November 13, 2025 at 12:32 AM
We continue with Emma Legrand, who won student best paper award. She presents their work on dynamic programming for the job sequencing and tool switching problem. Congratulations Emma and her co-authors Vianney Copp, Daniele Catanzaro, and Pierre Schaus!
doi.org/10.1007/978-...
November 13, 2025 at 12:13 AM
We continue with a presentation by Ramiz Gindullin who discusses their paper "Minimising Source-Plate Swaps for Robotised Compound Dispensing in Microplates"
doi.org/10.1007/978-...
November 12, 2025 at 11:53 PM
Our first application session of the day is on the subject of Manufacturing and Laboratory Scheduling. Philipp Danzinger gets us started with a presentation about how they were able to model and solve test laboratory scheduling problems in a generalized way.
doi.org/10.1007/978-...
November 12, 2025 at 11:32 PM
Our final day starts with an exciting invited talk joined with ICAPS by Bistra Dilkina how in her research machine learning meets combinatorial optimization. With her research well known in both our communities, everyone is excited to hear what she will tell us.
November 12, 2025 at 10:07 PM
Gaetano Signorelli gives the final presentation of the day. Their work tackles constrained machine learning through hyperspherical representation.
doi.org/10.1007/978-...
November 12, 2025 at 5:39 AM
We continue with Mark Turner's talk on the PySCIPOpt-ML framekwork, which allows you to embed trained machine learning models into mixed-integer programs.
doi.org/10.1007/978-...
November 12, 2025 at 5:16 AM
The second talk in the session titled "Multi-task Representation Learning for Mixed Integer Linear Programming" won the best paper award. Congratulations to Junyang Cai, Taoan Huang, and Bistra Dilkina!
doi.org/10.1007/978-...
November 12, 2025 at 4:55 AM
In our final session for the day, we're focused on a hot topic: machine learning and mixed integer programming. Connor Lawless will start the session and tells us how to use LLMs for cold-start cutting plane separator configuration.
doi.org/10.1007/978-...
November 12, 2025 at 4:33 AM
The final talk in the session is by Andrea Balogh who teaches us about partial knowledge compilation and how they can determine the most promising selective backbone size.
doi.org/10.1007/978-...
November 12, 2025 at 3:34 AM
Alexander Hoen guides us into the space of mixed integer programming and talks about analyzing the numerical correctness of branch-and-bound decisions for mixed-integer programming.
doi.org/10.1007/978-...
November 12, 2025 at 3:12 AM
Transitioning from SAT into lazy clause generation, Toby O. Davies talks about how lazy clause generation solvers can be parallelized with trail sharing.
doi.org/10.1007/978-...
November 12, 2025 at 2:52 AM
Continuing after lunch, CPAIOR dives into solving technologies. The first talk by Hendrik Bierlee on how many different pseudo-Boolean encodings for Satisfiability solving boil down to the same abstraction.
doi.org/10.1007/978-...
November 12, 2025 at 2:33 AM
Next year, CPAIOR will take place in Morocco. The website for the conference is already online: sites.google.com/view/cpaior2...
It includes the call for paper, and the deadline is less than a month away!
November 12, 2025 at 12:43 AM
Romain Barrault gives the final talk on satellites. Their work hybridizes machine learning and optimization to plan satellite observations.
doi.org/10.1007/978-...
November 12, 2025 at 12:16 AM
We continue on the topic of satellites with Julien Rouzot's talk on integer and constraint programming for the offline nanosatellite partition scheduling.
doi.org/10.1007/978-...
November 11, 2025 at 11:56 PM