CP 2024: THE 30TH INTERNATIONAL CONFERENCE ON PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING

This page contains an index consisting of author-provided keywords.

A
ACP	ACP Summer School
Acquisition	Constraint Acquisition - A Tutorial on Learning Constraint Models
Active Learning	Frugal Algorithm Selection
AI Planning	Using Constraint Programming for Disjunctive Scheduling in Temporal AI Planning
AI Search	Solving Patience and Solitaire Games with Good Old Fashioned AI
Announcement	CP 2025 CP-AI-OR 2025
Anytime algorithm	Anytime Weighted Model Counting with Approximation Guarantees
Arc consistency	Integer programming with successor and scaling Efficient Implementation of the Global Cardinality Constraint with Costs
Artificial Intelligence	Thinking fast and slow in AI: A cognitive architecture to augment both AI and human reasoning
Assembly Line	Constraint Programming Model for Assembly Line Balancing and Scheduling with Walking Workers and Parallel Stations
Assembly Line Balancing	Solving LBBD Master Problems with Constraint Programming and Domain-Independent Dynamic Programming Constraint Programming Model for Assembly Line Balancing and Scheduling with Walking Workers and Parallel Stations
Automated Algorithm Selection	Frugal Algorithm Selection
Award	Early Career Award. Enhancing constraint programming with machine learning: current challenges and future opportunities Distinguished Service Award
B
Bin Packing	CP for Bin Packing with Multi-core and GPUs
boolean satisfiability	Frugal Algorithm Selection The Complexity of Symmetry Breaking Beyond Lex-Leader
bounded treewidth	Exponential steepest ascent from valued constraint graphs of pathwidth four
bugs	Mutational Fuzz Testing for Constraint Modeling Systems
C
Calendars	Cumulative Scheduling with Calendars and Overtime
Car Sequencing Problem	An Investigation of Generic Approaches to Large Neighbourhood Search
cardinality constraints with costs	Efficient Implementation of the Global Cardinality Constraint with Costs
Career	Early Career Award. Enhancing constraint programming with machine learning: current challenges and future opportunities
certificates	A Multi-Stage Proof Logging Framework to Certify the Correctness of CP Solvers
certification	Certifying Without Loss of Generality Reasoning in Solution-Improving Maximum Satisfiability
certifying algorithms	Certifying Without Loss of Generality Reasoning in Solution-Improving Maximum Satisfiability
Cognitive Science	Thinking fast and slow in AI: A cognitive architecture to augment both AI and human reasoning
Combinatorial Optimization	An Investigation of Generic Approaches to Large Neighbourhood Search Certifying Without Loss of Generality Reasoning in Solution-Improving Maximum Satisfiability
combinatorial search	Computing small Rainbow Cycle Numbers with SAT modulo Symmetries
Combinatorics	Modeling and Solving Combinatorial Optimization Problems with Domain-Independent Dynamic Programming
Competition	Minizinc Challenge Results XCSP Competition Results
Compound Activities	Learning Effect and Compound Activities in High Multiplicity RCPSP: Application to Satellite Production
Conference	CP-AI-OR 2025
Constraint Acquisition	Constraint Modelling with LLMs using In-Context Learning
Constraint modeling language	Mutational Fuzz Testing for Constraint Modeling Systems
Constraint Modelling	Constraint Modelling with LLMs using In-Context Learning
constraint optimization	A CP/LS heuristic method for maxmin and minmax location problems with distance constraints
Constraint optimization problems	Deep Cooperation of Local Search and Unit Propagation Techniques
Constraint Programming	Frugal Algorithm Selection Solving LBBD Master Problems with Constraint Programming and Domain-Independent Dynamic Programming Black-Box Value Heuristics for solving Optimization problems with Constraint Programming Using Constraint Programming for Disjunctive Scheduling in Temporal AI Planning Constraint Programming Model for Assembly Line Balancing and Scheduling with Walking Workers and Parallel Stations Cumulative Scheduling with Calendars and Overtime Learning Effect and Compound Activities in High Multiplicity RCPSP: Application to Satellite Production Constraint Modelling with LLMs using In-Context Learning A New Optimization Model for Multiple-Control Toffoli Quantum Circuit Design A Multi-Stage Proof Logging Framework to Certify the Correctness of CP Solvers Constraint Programming with JuMP
constraint reformulation	Mutational Fuzz Testing for Constraint Modeling Systems
Constraint Satisfaction	Combining Constraint Programming Reasoning with Large Language Model Predictions
constraint satisfaction problems	Integer programming with successor and scaling CSPs with Few Alien Constraints
Constraints	Constraint Acquisition - A Tutorial on Learning Constraint Models
CP Conference	CP 2025
CP-AI-OR	CP-AI-OR 2025
cryptographic hash function	Inverting Step-reduced SHA-1 and MD5 by Parameterized SAT Solvers
Cube-and-Conquer	Inverting Step-reduced SHA-1 and MD5 by Parameterized SAT Solvers
Cumulative constraint	Cumulative Scheduling with Calendars and Overtime
D
Decision Diagram	Strengthening Relaxed Decision Diagrams for Maximum Independent Set Problem: Novel Variable Ordering and Merge Heuristics
decision diagrams	Pseudo-Boolean Reasoning About States and Transitions to Certify Dynamic Programming and Decision Diagrams
Distinguished	Distinguished Service Award
Distributed Constraint Optimization	Ex-Ante Constraint Elicitation in Incomplete DCOPs
Distributed Constraint Optimization Problems	Latency-Aware 2-Opt Monotonic Local Search for Distributed Constraint Optimization
Distributed Local Search Algorithms	Latency-Aware 2-Opt Monotonic Local Search for Distributed Constraint Optimization
Distributed Search Algorithms	Ex-Ante Constraint Elicitation in Incomplete DCOPs
Diversity	Diversity, Equity and Inclusion Presentation
Doctoral	Doctoral Research Award. Scalability in Decision-Focused Learning: State of the Art, Challenges, and Beyond
domain-independent dynamic programming	Solving LBBD Master Problems with Constraint Programming and Domain-Independent Dynamic Programming
Dual Bound	Strengthening Relaxed Decision Diagrams for Maximum Independent Set Problem: Novel Variable Ordering and Merge Heuristics
Dual Feasible Function	CP for Bin Packing with Multi-core and GPUs
Dynamic Programming	Strengthening Relaxed Decision Diagrams for Maximum Independent Set Problem: Novel Variable Ordering and Merge Heuristics Pseudo-Boolean Reasoning About States and Transitions to Certify Dynamic Programming and Decision Diagrams Modeling and Solving Combinatorial Optimization Problems with Domain-Independent Dynamic Programming
E
Early	Early Career Award. Enhancing constraint programming with machine learning: current challenges and future opportunities
EFX	Computing small Rainbow Cycle Numbers with SAT modulo Symmetries
Equity	Diversity, Equity and Inclusion Presentation
F
facility location	A CP/LS heuristic method for maxmin and minmax location problems with distance constraints
filtering algorithm	Efficient Implementation of the Global Cardinality Constraint with Costs
fuzztesting	Mutational Fuzz Testing for Constraint Modeling Systems
G
global constraint	Efficient Implementation of the Global Cardinality Constraint with Costs
Global constraints	Cumulative Scheduling with Calendars and Overtime
GPU	CP for Bin Packing with Multi-core and GPUs
Graph constraints	Encoding the Hamiltonian Cycle Problem into SAT Based on Vertex Elimination
graph isomorphism	The Complexity of Symmetry Breaking Beyond Lex-Leader
Graph neural network	Learning Lagrangian Multipliers for the Travelling Salesman Problem Learning Precedences for Scheduling Problems with Graph Neural Networks
graphical structure	Structure-guided Local Improvement for Maximum Satisfiability
H
heuristics	A CP/LS heuristic method for maxmin and minmax location problems with distance constraints
High-multiplicity Project Scheduling	Learning Effect and Compound Activities in High Multiplicity RCPSP: Application to Satellite Production
hybrid theories	CSPs with Few Alien Constraints
I
In-Context Learning	Constraint Modelling with LLMs using In-Context Learning
Inclusion	Diversity, Equity and Inclusion Presentation
Integer programming	Integer programming with successor and scaling
Integer Solution Counting	Improved Bounds of Integer Solution Counts via Volume and Extending to Mixed-Integer Linear Constraints
intractability	Exponential steepest ascent from valued constraint graphs of pathwidth four
J
Julia	Constraint Programming with JuMP
JuMP	Constraint Programming with JuMP
L
Lagrangian relaxation	Learning Lagrangian Multipliers for the Travelling Salesman Problem
Large Language Model	Combining Constraint Programming Reasoning with Large Language Model Predictions
Large Language Models	Constraint Modelling with LLMs using In-Context Learning
Large Neighborhood Search (LNS)	An Investigation of Generic Approaches to Large Neighbourhood Search
Latency-Awareness	Latency-Aware 2-Opt Monotonic Local Search for Distributed Constraint Optimization
Learning	Constraint Acquisition - A Tutorial on Learning Constraint Models
Learning Effect	Learning Effect and Compound Activities in High Multiplicity RCPSP: Application to Satellite Production
Limited Discrepancy Search	Anytime Weighted Model Counting with Approximation Guarantees
LNS	Structure-guided Local Improvement for Maximum Satisfiability
Local Search	Deep Cooperation of Local Search and Unit Propagation Techniques Exponential steepest ascent from valued constraint graphs of pathwidth four ParLS-PBO: A Parallel Local Search Solver for Pseudo Boolean Optimization An Efficient Local Search Solver for Mixed Integer Programming
logic-based Benders decomposition	Solving LBBD Master Problems with Constraint Programming and Domain-Independent Dynamic Programming
Look-Ahead	Black-Box Value Heuristics for solving Optimization problems with Constraint Programming
Lower Bound	CP for Bin Packing with Multi-core and GPUs
M
Machine Reassignment Problem	An Investigation of Generic Approaches to Large Neighbourhood Search
matrix models	The Complexity of Symmetry Breaking Beyond Lex-Leader
Maximum Independent Set Problem	Strengthening Relaxed Decision Diagrams for Maximum Independent Set Problem: Novel Variable Ordering and Merge Heuristics
Maximum Satisfiability	Certifying Without Loss of Generality Reasoning in Solution-Improving Maximum Satisfiability Slide&Drill, a new Approach for Multi-Objective Combinatorial Optimization Minimizing Working-Group Conflicts in Conference Session Scheduling through Maximum Satisfiability
MaxSAT	Certifying Without Loss of Generality Reasoning in Solution-Improving Maximum Satisfiability Structure-guided Local Improvement for Maximum Satisfiability
MD5	Inverting Step-reduced SHA-1 and MD5 by Parameterized SAT Solvers
Meta-reasoning	Thinking fast and slow in AI: A cognitive architecture to augment both AI and human reasoning
Metaheuristics	An Investigation of Generic Approaches to Large Neighbourhood Search
Minizinc	Minizinc Challenge Results
Mixed Integer Programming	An Efficient Local Search Solver for Mixed Integer Programming
Mixed-integer Linear Constraints	Improved Bounds of Integer Solution Counts via Volume and Extending to Mixed-Integer Linear Constraints
ML-augmented CP	Combining Constraint Programming Reasoning with Large Language Model Predictions
modeling	Mutational Fuzz Testing for Constraint Modeling Systems A CP/LS heuristic method for maxmin and minmax location problems with distance constraints Minimizing Working-Group Conflicts in Conference Session Scheduling through Maximum Satisfiability
Multi-Agent Optimization	Latency-Aware 2-Opt Monotonic Local Search for Distributed Constraint Optimization
Multi-Objective Combinatorial Optimization	Slide&Drill, a new Approach for Multi-Objective Combinatorial Optimization
mutational testing	Mutational Fuzz Testing for Constraint Modeling Systems
N
Named Entity Recognition	Constraint Modelling with LLMs using In-Context Learning
O
Operator	An Efficient Local Search Solver for Mixed Integer Programming
Optimization	Black-Box Value Heuristics for solving Optimization problems with Constraint Programming Constraint Modelling with LLMs using In-Context Learning Modeling and Solving Combinatorial Optimization Problems with Domain-Independent Dynamic Programming
Overtime	Cumulative Scheduling with Calendars and Overtime
P
Parallel Solving	ParLS-PBO: A Parallel Local Search Solver for Pseudo Boolean Optimization
Parallel Workstations	Constraint Programming Model for Assembly Line Balancing and Scheduling with Walking Workers and Parallel Stations
Parallelism	CP for Bin Packing with Multi-core and GPUs
parameterized complexity	CSPs with Few Alien Constraints
Patience Games	Solving Patience and Solitaire Games with Good Old Fashioned AI
PhD	Doctoral Research Award. Scalability in Decision-Focused Learning: State of the Art, Challenges, and Beyond
Precedence graph	Learning Precedences for Scheduling Problems with Graph Neural Networks
Preference Elicitation	Ex-Ante Constraint Elicitation in Incomplete DCOPs
preimage attack	Inverting Step-reduced SHA-1 and MD5 by Parameterized SAT Solvers
Probabilistic Reasoning	Anytime Weighted Model Counting with Approximation Guarantees
Projected Weighted Model Counting	Anytime Weighted Model Counting with Approximation Guarantees
proof logging	Certifying Without Loss of Generality Reasoning in Solution-Improving Maximum Satisfiability Pseudo-Boolean Reasoning About States and Transitions to Certify Dynamic Programming and Decision Diagrams A Multi-Stage Proof Logging Framework to Certify the Correctness of CP Solvers
proofs	A Multi-Stage Proof Logging Framework to Certify the Correctness of CP Solvers
Propagation	CP for Bin Packing with Multi-core and GPUs
Pruning	CP for Bin Packing with Multi-core and GPUs
pseudo-Boolean	Certifying Without Loss of Generality Reasoning in Solution-Improving Maximum Satisfiability
Pseudo-Boolean Optimization	ParLS-PBO: A Parallel Local Search Solver for Pseudo Boolean Optimization
Q
Quantum Circuit Design	A New Optimization Model for Multiple-Control Toffoli Quantum Circuit Design
R
rainbow cycle number	Computing small Rainbow Cycle Numbers with SAT modulo Symmetries
Research	Doctoral Research Award. Scalability in Decision-Focused Learning: State of the Art, Challenges, and Beyond
Resource Constrained Project Scheduling Problem	Constraint Programming Model for Assembly Line Balancing and Scheduling with Walking Workers and Parallel Stations
Results	XCSP Competition Results
Retrieval-Augmented In-Context Learning	Constraint Modelling with LLMs using In-Context Learning
Reversible Circuits	A New Optimization Model for Multiple-Control Toffoli Quantum Circuit Design
S
SAT	Inverting Step-reduced SHA-1 and MD5 by Parameterized SAT Solvers
SAT encoding	Encoding the Hamiltonian Cycle Problem into SAT Based on Vertex Elimination
SAT modulo Symmetries	Computing small Rainbow Cycle Numbers with SAT modulo Symmetries
SAT-UNSAT	Certifying Without Loss of Generality Reasoning in Solution-Improving Maximum Satisfiability
Satellite Assembly Line	Learning Effect and Compound Activities in High Multiplicity RCPSP: Application to Satellite Production
Satisfiability Algorithms	Slide&Drill, a new Approach for Multi-Objective Combinatorial Optimization
Scheduling	Using Constraint Programming for Disjunctive Scheduling in Temporal AI Planning Cumulative Scheduling with Calendars and Overtime Learning Precedences for Scheduling Problems with Graph Neural Networks Minimizing Working-Group Conflicts in Conference Session Scheduling through Maximum Satisfiability
School	ACP Summer School
Scoring Function	ParLS-PBO: A Parallel Local Search Solver for Pseudo Boolean Optimization An Efficient Local Search Solver for Mixed Integer Programming
sequence-dependent setup	Solving LBBD Master Problems with Constraint Programming and Domain-Independent Dynamic Programming
Service	Distinguished Service Award
SHA-1	Inverting Step-reduced SHA-1 and MD5 by Parameterized SAT Solvers
SLIM	Structure-guided Local Improvement for Maximum Satisfiability
Solitaire	Solving Patience and Solitaire Games with Good Old Fashioned AI
Solution Pool	ParLS-PBO: A Parallel Local Search Solver for Pseudo Boolean Optimization
solution-improving search	Certifying Without Loss of Generality Reasoning in Solution-Improving Maximum Satisfiability
Solver	Minizinc Challenge Results
Steel Mill Slab Problem	An Investigation of Generic Approaches to Large Neighbourhood Search
steepest ascent	Exponential steepest ascent from valued constraint graphs of pathwidth four
Successor	Integer programming with successor and scaling
Summer	ACP Summer School
symmetry breaking	The Complexity of Symmetry Breaking Beyond Lex-Leader Learning Effect and Compound Activities in High Multiplicity RCPSP: Application to Satellite Production
T
Temporal-Numeric Planning	Using Constraint Programming for Disjunctive Scheduling in Temporal AI Planning
the Hamiltonian cycle problem	Encoding the Hamiltonian Cycle Problem into SAT Based on Vertex Elimination
Time-Tabling	Cumulative Scheduling with Calendars and Overtime
U
Unit propagation	Deep Cooperation of Local Search and Unit Propagation Techniques
Unsupervised learning	Learning Lagrangian Multipliers for the Travelling Salesman Problem
V
Value Selection	Black-Box Value Heuristics for solving Optimization problems with Constraint Programming
valued constraint satisfaction problem	Exponential steepest ascent from valued constraint graphs of pathwidth four
veripb	A Multi-Stage Proof Logging Framework to Certify the Correctness of CP Solvers
Vertex elimination	Encoding the Hamiltonian Cycle Problem into SAT Based on Vertex Elimination
Volume of Polytopes	Improved Bounds of Integer Solution Counts via Volume and Extending to Mixed-Integer Linear Constraints
W
Walking Workers	Constraint Programming Model for Assembly Line Balancing and Scheduling with Walking Workers and Parallel Stations
X
XCSP	XCSP Competition Results
Y
Year 2025	CP 2025

Disclaimer | Powered by EasyChair Smart Program