Schedule
Presenting authors are marked with an asterisk (*).
Monday 20 July
▶CP 2026 main conference sessions are listed below. FLoC plenaries, breaks, and lunches are shown as all-conference events.
09:00 – 10:00
All-conference
FLoC plenary
09:00 – 10:00
10:00 – 10:30
All-conference
Coffee Break
10:00 – 10:30
10:30 – 10:45
Opening
Room 1
CP OPENING
10:30 – 10:45
CP Opening
10:45 – 10:50
All-conference
Break
10:45 – 10:50
10:50 – 12:30
Paper
Room 1
SCHEDULING
10:50 – 11:10
On Inferring Cumulative Constraints
11:10 – 11:30
Augmenting the Cumulative Overload Check with Integral Resource Usage Reasoning
11:30 – 11:50
Revisiting Optional Variables in Lazy Clause Generation Solvers for Flexible Scheduling
11:50 – 12:10
Instance Space Analysis and Complexity Estimation for Scheduling Problem
12:10 – 12:30
Accelerating Constraint Programming Solver with Parallel External Heuristics: Experiments on Scheduling and Routing Problems
Paper
Room 2
SAT, MAXSAT, CP-SAT
10:50 – 11:10
Not All Restarts are Equal: MAB-Learning at the Right Time Scale for SAT
11:10 – 11:30
Efficient Explanations for Rule Ensembles
11:30 – 11:50
Enhanced Lower Bound Computation in Branch-and-Bound for MaxSAT
11:50 – 12:10
From Literals to Atomic Constraints: Generalising Conflict-Driven Clause Learning for Constraint Programming
12:10 – 12:30
Satisfiability for Large Weight Syndrome Decoding
12:30 – 14:00
All-conference
Lunch
12:30 – 14:00
14:00 – 16:00
Tutorial
Room 1
ROUTING/SCHEDULING & GPU FOR PROPAGATION
14:00 – 15:00
From CP Fundamentals with MiniCP to Solving Routing and Scheduling Applications with MaxiCP
15:00 – 16:00
Despicable Cores: Thousands of GPU Minions for Constraint Propagation
16:00 – 16:30
All-conference
Coffee Break
16:00 – 16:30
16:30 – 18:00
All-conference
Travel to Opening Reception Venue
16:30 – 18:00
Tuesday 21 July
▶CP 2026 main conference sessions are listed below. FLoC plenaries, breaks, and lunches are shown as all-conference events.
09:00 – 10:00
Invited Talk
Room 1
DECISION DIAGRAMS
09:00 – 10:00
Decision Diagrams for Constraint Reasoning and Optimization
10:00 – 10:30
All-conference
Coffee Break
10:00 – 10:30
10:30 – 11:45
Paper
Room 1
ACP AWARDS & NEXT CP/CPAIOR
10:30 – 10:35
Distinguished service award
10:35 – 11:05
Early career award
11:05 – 11:35
Doctoral research award
11:35 – 11:45
Presentation of next CP & CPAIOR conferences
11:45 – 11:50
All-conference
Break
11:45 – 11:50
11:50 – 12:30
Paper
Room 1
REFORMULATION, MDD/FLOW
11:50 – 12:10
Table Constraints for Integer Programming
12:10 – 12:30
The Voice of the Flow: A Graph-based Approach for Step-Wise Explanations of Constraint Satisfaction Problems
Paper
Room 2
APPLICATION: MODELLING
11:50 – 12:10
Paratransit Optimization with Constraint Programming: A Case Study in Savannah, Georgia
12:10 – 12:30
Configuration of Heterogeneous Agent Fleets for Cognitively Demanding Missions
12:30 – 14:00
All-conference
Lunch
12:30 – 14:00
14:00 – 16:00
Paper
Room 1
VERIFICATION, CERTIFICATION
14:00 – 14:20
From LLM Suggestions to Lean Proofs: Verified Redundant Constraints for MiniZinc
14:20 – 14:40
Formally Verified Certification of Constraint Programming Proofs
14:40 – 15:00
Proof Logging for Projected Enumeration (and Counting?) Problems in VeriPB
15:00 – 15:20
VIPR Certificate Construction from Black-Box ILP Solvers
15:20 – 15:40
End-To-End Certified Graph Colouring
15:40 – 16:00
On the Self-Stabilization of Dijkstra’s Asynchronous Token Circulation
Paper
Room 2
SCHEDULING; TIMETABLING
14:00 – 14:20
A Scheduling-Based Approach to Railway Capacity Estimation for Industrial Freight Junctions (Best Application Paper Runner-Up)
14:20 – 14:40
An Iterative Constraint Programming Approach to Integrate Maximum Workload Constraints in Preemptive Jobshop Scheduling (Best Student Paper Runner-Up)
14:40 – 15:00
Constraint Programming for Mixed-Model Assembly Line Scheduling with Complex Industrial Constraints
15:00 – 15:20
The CP Shortcut: Solving the High-Power Pump Activation Problem Without the Overkill
15:20 – 15:40
Approximating Time-Dependent Transition Times in Constraint Programming for an Earth Observation Mission
15:40 – 16:00
Constraint Programming for Curriculum-Based High School Timetabling with Half-Blocks
16:00 – 16:30
All-conference
Coffee Break
16:00 – 16:30
16:30 – 18:00
General assembly
Room 1
DEI & GENERAL ASSEMBLY
16:30 – 16:50
DEI event
16:50 – 18:00
General assembly
Wednesday 22 July
▶CP 2026 main conference sessions are listed below. FLoC plenaries, breaks, and lunches are shown as all-conference events.
09:00 – 10:00
All-conference
FLoC keynote
09:00 – 10:00
10:00 – 10:30
All-conference
Coffee Break
10:00 – 10:30
10:30 – 12:30
Tutorial
Room 1
BEYOND FILTERING & GLOBAL HYBRID OPTIMISATION SOLVER
10:30 – 11:30
Exploiting Combinatorial Structure in Constraint Programming: Going Beyond Domain Filtering to Model Counting and Marginal Distributions over Domains
11:30 – 12:30
Hexaly, a Global Hybrid Optimization Solver
12:30 – 13:55
All-conference
Lunch
12:30 – 13:55
13:55 – 14:35
Panel
Room 1
CONSTRAINT JOURNAL PANEL & CONSTRAINT JOURNAL AWARDS
13:55 – 14:35
Thirtieth Anniversary of the Constraints Journal Panel & Constraints journal awards
14:35 – 14:40
All-conference
Break
14:35 – 14:40
14:40 – 16:00
Paper
Room 1
FILTERING, SEARCH, MODELLING
14:40 – 15:00
The Distance Constraint on Sequence Variables
15:00 – 15:20
Modeling the p-Dispersion Problem with Distance Constraints
15:20 – 15:40
Lightweight Look-Ahead-Based Value Heuristics for Constraint Optimization Problems
15:40 – 16:00
An Automata-Based Constraint Programming Framework for Optimal Classical Planning
Paper
Room 2
APPLICATION (LOGISTICS, HVAC Optimisation, PLAYOFF CLINCHING)
14:40 – 15:00
Scaling Industrial Logistics: Tackling Multi-Batching Problems via Sequential Solving
15:00 – 15:20
Optimizing a Multi-Commodity Home-Delivery and Pickup Service in Depopulated Rural Areas with Constraint Programming
15:20 – 15:40
Modelling and Optimizing HVAC Systems for Early-Stage Building Design
15:40 – 16:00
A Constraint Programming Approach for n-Day Lookahead Playoff Clinching in the NHL
16:00 – 16:30
All-conference
Coffee Break
16:00 – 16:30
16:30 – 17:50
Paper
Room 1
METAHEURISTICS, PORTFOLIO
16:30 – 16:50
Constraint Solving and Particle Swarm Optimization for Fixture Layout Optimization
16:50 – 17:10
Neurosymbolic Large Neighbourhood Search
17:10 – 17:30
Automatic Relaxation and Multi-Armed Bandit Learning for Large Neighbourhood Search
17:30 – 17:50
On the Effect of Training Data Selection in Automated Algorithm Selection
Paper
Room 2
HYBRID MIP/CP, ROUTING, PARETO
16:30 – 16:50
Identifying Multi-Hit Cancer Drivers Without Massive Parallelization: A CP, MIP, and Column Generation Framework
16:50 – 17:10
Revisiting Integer Programming Encodings of Acyclicity
17:10 – 17:30
Constraint-Aware Self-Supervised Learning for Edge Selection
17:30 – 17:50
Combining an ε-Constraint Method with the Pareto Global Constraint
18:00 – 19:00
All-conference
Travel to Banquet
18:00 – 19:00
Thursday 23 July
CP 2026 main conference sessions are listed below. FLoC plenaries, breaks, and lunches are shown as all-conference events.
09:00 – 10:00
Invited Talk
Room 1
ASP
09:00 – 10:00
Bridging the Gap: Foundedness, Defaults, and Expressivity in Constraint Answer Set Programming
10:00 – 10:30
All-conference
Coffee Break
10:00 – 10:30
10:30 – 12:00
Paper
Room 1
BEST PAPERS & COMPETITION RESULTS
10:30 – 10:50
GPU-Accelerated Relaxed Decision Diagrams for Branch-and-Bound Optimization (Best Paper)
10:50 – 11:10
Solving the Multiple Constant Multiplication Problem with Constraint Programming (Best Student Paper)
11:10 – 11:30
CrewAId: Interactive Optimisation for Human-In-The-Loop Crew Rostering and Rerostering (Best Application Paper)
11:30 – 12:00
Solvers competition results
12:00 – 12:05
All-conference
Break
12:00 – 12:05
12:05 – 12:25
Paper
Room 1
EXPLANATIONS
12:05 – 12:25
Towards Step-Wise Explanations of Large Search Trees
Paper
Room 2
SMT
12:05 – 12:25
Learning Unified Graph and Language Representations for SMT Algorithm Selection
12:25 – 13:55
All-conference
Lunch
12:25 – 13:55
13:55 – 14:35
Panel
Room 1
HOLY GRAIL PANEL
13:55 – 14:35
Thirty Years of Progress Towards the Holy Grail Panel
14:35 – 14:40
All-conference
Break
14:35 – 14:40
14:40 – 16:00
Paper
Room 1
DYNAMIC PROGRAMMING & SCHEDULING
14:40 – 15:00
Linear-Memory Beam Search Algorithms in Domain-Independent Dynamic Programming
15:00 – 15:20
Column Generation with Domain-Independent Dynamic Programming
15:20 – 15:40
GRID: Graph-based Modelling Interface for Domain-Independent Dynamic Programming
15:40 – 16:00
Assembly Line Balancing with Parallel Stations and Shared Resources: A Cycle-Relative Constraint Programming Approach
Paper
Room 2
APPLICATION (PRODUCTION, TIMETABLING, AUTOMATED DRIVING SYSTEMS)
14:40 – 15:00
From CP Modeling to Preference Elicitation in HMLV Assembly Problems
15:00 – 15:20
Equal-sized Partition Problem: Application in Spinning and Yarn Production
15:20 – 15:40
A Two-Stage Constraint Programming Approach for Artificial Teeth Scheduling
15:40 – 16:00
ScenaGen: A CP Model for Grounding Qualitative Driving Scenarios
16:00 – 16:30
All-conference
Coffee Break
16:00 – 16:30
16:30 – 17:30
Paper
Room 1
DATA MINING
16:30 – 16:50
Fairness of Classifiers in the Presence of Constraints Between Features (Best Paper Runner-Up)
16:50 – 17:10
Utility-Peak Itemset Mining with Constraint Programming
17:10 – 17:30
An Offline Neuro-Symbolic Football Pattern Retrieval Approach Using Constraint Programming
Paper
Room 2
THEORY 1
16:30 – 16:50
Computing Short SAT Implicants via Ising/QUBO Encodings
16:50 – 17:10
Smart Cubing for Graph Search: A Comparative Study
17:10 – 17:30
On Symmetries and Transformations
17:30 – 17:35
All-conference
Break
17:30 – 17:35
17:35 – 18:00
Paper
Room 1
THEORY 2 & CLOSING
17:35 – 17:55
Classification of Non-Redundancy of Boolean Predicates of Arity 4
17:55 – 18:00
CP Closing