PROGRAM
Days: Monday, September 2nd Tuesday, September 3rd Wednesday, September 4th Thursday, September 5th Friday, September 6th
Monday, September 2nd
View this program: with abstractssession overviewtalk overview
10:30-11:00Coffee Break
12:30-14:00Lunch
15:30-16:00Coffee Break
Tuesday, September 3rd
View this program: with abstractssession overviewtalk overview
09:00-10:00 Session 3A: Invited Talk
Chair:
Location: Aula Magna Modest Prats
09:00 | Solving Patience and Solitaire Games with Good Old Fashioned AI (abstract) |
10:00-10:30Coffee Break [Posters]
10:30-11:00 Session 4: Best Application Paper Award
Chair:
Location: Aula Magna Modest Prats
10:30 | Learning Effect and Compound Activities in High Multiplicity RCPSP: Application to Satellite Production (abstract) |
11:00-12:30 Session 5A: SAT and MaxSAT
Chair:
Location: Aula Magna Modest Prats
11:00 | Certifying Without Loss of Generality Reasoning in Solution-Improving Maximum Satisfiability (abstract) |
11:30 | Slide&Drill, a new Approach for Multi-Objective Combinatorial Optimization (abstract) |
12:00 | Structure-guided Local Improvement for Maximum Satisfiability (abstract) |
11:00-12:30 Session 5B: Local Search I
Chair:
Location: Sala de Graus - Cloister Area
11:00 | ParLS-PBO: A Parallel Local Search Solver for Pseudo Boolean Optimization (abstract) |
11:30 | Latency-Aware 2-Opt Monotonic Local Search for Distributed Constraint Optimization (abstract) |
12:00 | An Investigation of Generic Approaches to Large Neighbourhood Search (abstract) |
12:30-14:00Lunch
14:00-15:30 Session 6A: Tutorial
Chair:
Location: Aula Magna Modest Prats
14:00 | Modeling and Solving Combinatorial Optimization Problems with Domain-Independent Dynamic Programming (abstract) PRESENTER: J. Christopher Beck |
14:00-15:30 Session 6B: Heuristics
Chair:
Location: Sala de Graus - Cloister Area
14:00 | Black-Box Value Heuristics for solving Optimization problems with Constraint Programming (abstract) |
14:30 | Strengthening Relaxed Decision Diagrams for Maximum Independent Set Problem: Novel Variable Ordering and Merge Heuristics (abstract) |
15:00 | Ex-Ante Constraint Elicitation in Incomplete DCOPs (abstract) |
15:30-16:00Coffee Break [Posters]
16:00-16:30 Session 7: Best Machine Learning Paper Award
Chair:
Location: Aula Magna Modest Prats
16:00 | Learning Lagrangian Multipliers for the Travelling Salesman Problem (abstract) |
Wednesday, September 4th
View this program: with abstractssession overviewtalk overview
09:00-10:10 Session 8: ACP Awards
Chair:
Location: Aula Magna Modest Prats
09:00 | Early Career Award. Enhancing constraint programming with machine learning: current challenges and future opportunities (abstract) |
09:30 | Doctoral Research Award. Scalability in Decision-Focused Learning: State of the Art, Challenges, and Beyond (abstract) |
10:00 | Distinguished Service Award |
10:10-10:40Coffee Break [Posters]
10:40-12:10 Session 9A: Machine Learning
Chair:
Location: Aula Magna Modest Prats
10:40 | Frugal Algorithm Selection (abstract) |
11:10 | Combining Constraint Programming Reasoning with Large Language Model Predictions (abstract) |
11:40 | Constraint Modelling with LLMs using In-Context Learning (abstract) |
10:40-12:10 Session 9B: Certification and Testing
Chair:
Location: Sala de Graus - Cloister Area
10:40 | Mutational Fuzz Testing for Constraint Modeling Systems (abstract) |
11:10 | Pseudo-Boolean Reasoning About States and Transitions to Certify Dynamic Programming and Decision Diagrams (abstract) |
11:40 | A Multi-Stage Proof Logging Framework to Certify the Correctness of CP Solvers (abstract) |
12:10-13:30Lunch
13:30-14:00 Session 10: Best Paper Award
Chair:
Location: Aula Magna Modest Prats
13:30 | An Efficient Local Search Solver for Mixed Integer Programming (abstract) |
14:00-15:30 Session 11A: Tutorial
Chair:
Location: Aula Magna Modest Prats
14:00 | Constraint Programming with JuMP (abstract) |
14:00-15:30 Session 11B: Scheduling
Chair:
Location: Sala de Graus - Cloister Area
14:00 | Using Constraint Programming for Disjunctive Scheduling in Temporal AI Planning (abstract) |
14:30 | Learning Precedences for Scheduling Problems with Graph Neural Networks (abstract) |
15:00 | Solving LBBD Master Problems with Constraint Programming and Domain-Independent Dynamic Programming (abstract) |
15:30-16:00Coffee Break [Posters]
17:00-18:00 Session 13A: Global Constraints
Chair:
Location: Aula Magna Modest Prats
17:00 | Efficient Implementation of the Global Cardinality Constraint with Costs (abstract) |
17:30 | Cumulative Scheduling with Calendars and Overtime (abstract) |
17:00-18:00 Session 13B: Computer Hardware
Chair:
Location: Sala de Graus - Cloister Area
17:00 | A New Optimization Model for Multiple-Control Toffoli Quantum Circuit Design (abstract) |
17:30 | CP for Bin Packing with Multi-core and GPUs (abstract) |
Thursday, September 5th
View this program: with abstractssession overviewtalk overview
09:00-10:00 Session 14: Invited Talk
Chair:
Location: Aula Magna Modest Prats
09:00 | Thinking fast and slow in AI: A cognitive architecture to augment both AI and human reasoning (abstract) |
10:00-10:30Coffee Break
10:30-11:00 Session 15: Solver Challenge Results
Location: Aula Magna Modest Prats
10:30 | Minizinc Challenge Results |
10:45 | XCSP Competition Results |
11:00-11:15 Session 16: Presentation of 2025 Events
Location: Aula Magna Modest Prats
11:00 | CP 2025 |
11:05 | CP-AI-OR 2025 |
11:10 | ACP Summer School |
11:15-11:30 Session 17: DEI Presentation
Location: Aula Magna Modest Prats
11:15 | Diversity, Equity and Inclusion Presentation PRESENTER: Özgür Akgün |
12:30-13:30Lunch
13:30-15:00 Session 19A: Tutorial
Chair:
Location: Aula Magna Modest Prats
13:30 | Constraint Acquisition - A Tutorial on Learning Constraint Models (abstract) |
13:30-15:00 Session 19B: Applications
Chair:
Location: Sala de Graus - Cloister Area
13:30 | Minimizing Working-Group Conflicts in Conference Session Scheduling through Maximum Satisfiability (abstract) |
14:00 | Inverting Step-reduced SHA-1 and MD5 by Parameterized SAT Solvers (abstract) |
14:30 | Constraint Programming Model for Assembly Line Balancing and Scheduling with Walking Workers and Parallel Stations (abstract) |
Friday, September 6th
View this program: with abstractssession overviewtalk overview
09:00-10:30 Session 20A: Local Search II
Chair:
Location: Aula Magna Modest Prats
09:00 | Deep Cooperation of Local Search and Unit Propagation Techniques (abstract) |
09:30 | A CP/LS heuristic method for maxmin and minmax location problems with distance constraints (abstract) |
10:00 | Exponential steepest ascent from valued constraint graphs of pathwidth four (abstract) |
09:00-10:30 Session 20B: Theory and Complexity
Chair:
Location: Sala de Graus - Cloister Area
09:00 | Integer programming with successor and scaling (abstract) |
09:30 | The Complexity of Symmetry Breaking Beyond Lex-Leader (abstract) |
10:00 | CSPs with Few Alien Constraints (abstract) |
10:30-11:00Coffee Break
11:00-12:00 Session 21A: Graphs
Chair:
Location: Aula Magna Modest Prats
11:00 | Computing small Rainbow Cycle Numbers with SAT modulo Symmetries (abstract) |
11:30 | Encoding the Hamiltonian Cycle Problem into SAT Based on Vertex Elimination (abstract) |
11:00-12:00 Session 21B: Model Counting
Chair:
Location: Sala de Graus - Cloister Area
11:00 | Anytime Weighted Model Counting with Approximation Guarantees (abstract) |
11:30 | Improved Bounds of Integer Solution Counts via Volume and Extending to Mixed-Integer Linear Constraints (abstract) |
12:10-13:30Lunch