CP 2023: 29TH INTERNATIONAL CONFERENCE ON PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING

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

#
#QBF	Enumerative Level-2 Solution Counting for Quantified Boolean Formulas
A
Active learning	Guided Bottom-Up Interactive Constraint Acquisition
Aggregate Dynamic Programming	Boosting Decision Diagram-Based Branch-and-Bound by Pre-Solving with Aggregate Dynamic Programming
allocation problem	Constraint Programming with External Worst-Case Traversal Time Analysis
Answer set programming	Efficient enumeration of fixed points in complex Boolean networks using answer set programming
arithmetic constraints	Proven optimally-balanced Latin rectangles with SAT
Assembly line design	Assembly Line Preliminary Design Optimization for an Aircraft Airframe
automatic configuration	Exploiting Configurations of MaxSAT solvers
Autonomous Trucking	Constraint Programming to Improve Hub Utilization in Autonomous Transfer Hub Networks
B
Baysian Network	Probabilistic Inference by Projected Weighted Model Counting on Horn Clauses
Benzenoid Generation Problem	Using Canonical Codes to Efficiently Solve the Benzenoid Generation Problem with Constraint Programming
Binary Constraint Tree	Binary Constraint Trees and Structured Decomposability
Binary CSP	Binary Constraint Trees and Structured Decomposability
Binary Decision Diagram	SAT-Based Learning of Compact Binary Decision Diagrams for Classification
black-box external function	Constraint Programming with External Worst-Case Traversal Time Analysis
Boolean network	Efficient enumeration of fixed points in complex Boolean networks using answer set programming
Branching heuristics	Learning a Generic Value-Selection Heuristic Inside a Generic Constraint Programming Solver
BT compilation	From Formal Boosted Tree Explanations to Interpretable Rule Sets
C
Canonical code	Using Canonical Codes to Efficiently Solve the Benzenoid Generation Problem with Constraint Programming
certified optimality	Proven optimally-balanced Latin rectangles with SAT
Classification	SAT-Based Learning of Compact Binary Decision Diagrams for Classification
cliques	A New Approach to Generating 2 x n Partially Spatially Balanced Latin Rectangles
combinatorial design	Proven optimally-balanced Latin rectangles with SAT
combinatorial optimization	Constraint programming models for depth-optimal qubit assignment and SWAP-based routing Large Neighborhood Beam Search for Domain-Independent Dynamic Programming A New Approach to Generating 2 x n Partially Spatially Balanced Latin Rectangles
Compactness	SAT-Based Learning of Compact Binary Decision Diagrams for Classification
Computational systems biology	Efficient enumeration of fixed points in complex Boolean networks using answer set programming
computer-assisted proofs	Fast Matrix Multiplication Without Tears: A Constraint Programming Approach
Conflict Analysis	Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning
constrained-based combinatorics	Searching for smallest universal graphs and tournaments with SAT
Constraint Acquisition	Guided Bottom-Up Interactive Constraint Acquisition
Constraint Learning	Guided Bottom-Up Interactive Constraint Acquisition
constraint modeling	Constraint Model for the Satellite Image Mosaic Selection Problem
Constraint optimization problem	Incremental Constrained Clustering by Minimal Weighted Modification A CP Approach for the Liner Shipping Network Design Problem
Constraint programming	Fast Matrix Multiplication Without Tears: A Constraint Programming Approach Simplifying Step-wise Explanation Sequences An Efficient Constraint Programming Approach for Scheduling Interruptible Tasks Requiring Disjoint Disjunctive Resources Optimization of Short-Term Underground Mine Planning using Constraint Programming Partitioning a Map into Homogeneous Contiguous Regions: A Branch-and-Bound approach Using Decision Diagrams Constraint programming models for depth-optimal qubit assignment and SWAP-based routing MDD archive for boosting the Pareto constraint Assembly Line Preliminary Design Optimization for an Aircraft Airframe Partially Preemptive Multi Skill/Mode Resource-constrained Project Scheduling with Generalized Precedence Relations and Calendars Learning a Generic Value-Selection Heuristic Inside a Generic Constraint Programming Solver Constraint Model for the Satellite Image Mosaic Selection Problem Constraint Programming to Improve Hub Utilization in Autonomous Transfer Hub Networks
constraint satisfaction problem	Fast Matrix Multiplication Without Tears: A Constraint Programming Approach
Constraint Satisfaction Problems	FastMapSVM for Predicting CSP Satisfiability
cube-and-conquer	Symmetries for cube-and-conquer in finite model finding
Cumulative Scheduling	Horizontally Elastic Edge Finder Rule for Cumulative Constraint Based on Slack and Density
Cutting Planes Proof System	Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning
D
Decision Diagrams	Boosting Decision Diagram-Based Branch-and-Bound by Pre-Solving with Aggregate Dynamic Programming
decision set	From Formal Boosted Tree Explanations to Interpretable Rule Sets
deduction	Simplifying Step-wise Explanation Sequences
Deep Optimization	Improving Local Search for Pseudo Boolean Optimization by Deep Optimization
Deep reinforcement learning	Learning a Generic Value-Selection Heuristic Inside a Generic Constraint Programming Solver
Dial-a-ride problem	Optimization models for pickup and delivery problems with reconfigurable capacities
directed graph	Searching for smallest universal graphs and tournaments with SAT
Discrete Optimization	Boosting Decision Diagram-Based Branch-and-Bound by Pre-Solving with Aggregate Dynamic Programming
Division	Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning
Domain Specific Languages	Addressing problem drift in the UNHCR fund allocation problem
Dynamic Programming	Large Neighborhood Beam Search for Domain-Independent Dynamic Programming
E
Edge Finding Rule	Horizontally Elastic Edge Finder Rule for Cumulative Constraint Based on Slack and Density
explanation	Simplifying Step-wise Explanation Sequences
extensional constraints
F
Facility location	The p-dispersion problem with distance constraints
fast matrix multiplication	Fast Matrix Multiplication Without Tears: A Constraint Programming Approach
FastMapSVM	FastMapSVM for Predicting CSP Satisfiability
finite model enumeration	Symmetries for cube-and-conquer in finite model finding
Fixed point	Efficient enumeration of fixed points in complex Boolean networks using answer set programming
formal explanations	From Formal Boosted Tree Explanations to Interpretable Rule Sets
Fund Allocation	Addressing problem drift in the UNHCR fund allocation problem
G
gradient boosting tree	From Formal Boosted Tree Explanations to Interpretable Rule Sets
Graph	Using Canonical Codes to Efficiently Solve the Benzenoid Generation Problem with Constraint Programming
H
Horizontally Elastic Scheduling	Horizontally Elastic Edge Finder Rule for Cumulative Constraint Based on Slack and Density
Human-Centric Optimisation
Hydrogen Supply Chain
I
ILP	The p-dispersion problem with distance constraints
imbalance	A New Approach to Generating 2 x n Partially Spatially Balanced Latin Rectangles
Incremental constrained clustering	Incremental Constrained Clustering by Minimal Weighted Modification
Industrial application	A CP Approach for the Liner Shipping Network Design Problem
Industry 4.0	Assembly Line Preliminary Design Optimization for an Aircraft Airframe
Integer Programming	Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning
Interactive	Guided Bottom-Up Interactive Constraint Acquisition
interpretable model	From Formal Boosted Tree Explanations to Interpretable Rule Sets
L
Large Neighborhood Search	Large Neighborhood Beam Search for Domain-Independent Dynamic Programming Partially Preemptive Multi Skill/Mode Resource-constrained Project Scheduling with Generalized Precedence Relations and Calendars
Large-scale scheduling problem	Partially Preemptive Multi Skill/Mode Resource-constrained Project Scheduling with Generalized Precedence Relations and Calendars
Latin squares	A New Approach to Generating 2 x n Partially Spatially Balanced Latin Rectangles
least number heuristic	Symmetries for cube-and-conquer in finite model finding
Local Search	Improving Local Search for Pseudo Boolean Optimization by Deep Optimization
M
Machine Learning	FastMapSVM for Predicting CSP Satisfiability
maximum satisfiability	Preprocessing in SAT-Based Multi-Objective Combinatorial Optimization Exploiting Configurations of MaxSAT solvers
MaxSAT	SAT-Based Learning of Compact Binary Decision Diagrams for Classification
maxsat evaluation	Exploiting Configurations of MaxSAT solvers
Mine planning	Optimization of Short-Term Underground Mine Planning using Constraint Programming
MiniZinc	Addressing problem drift in the UNHCR fund allocation problem
Mixed integer programming	A New Approach to Generating 2 x n Partially Spatially Balanced Latin Rectangles
Mixed Integer Rounding	Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning
Model Counting	Probabilistic Inference by Projected Weighted Model Counting on Horn Clauses
Modeling	The p-dispersion problem with distance constraints A CP Approach for the Liner Shipping Network Design Problem Guided Bottom-Up Interactive Constraint Acquisition
Modelling	Predict-then-Optimise Strategies for Water Flow Control
Multi-mode	Partially Preemptive Multi Skill/Mode Resource-constrained Project Scheduling with Generalized Precedence Relations and Calendars
Multi-objective	MDD archive for boosting the Pareto constraint Assembly Line Preliminary Design Optimization for an Aircraft Airframe
multi-objective combinatorial optimization	Preprocessing in SAT-Based Multi-Objective Combinatorial Optimization
multi-objective constraint programming	Constraint Programming with External Worst-Case Traversal Time Analysis
Multi-skill	Partially Preemptive Multi Skill/Mode Resource-constrained Project Scheduling with Generalized Precedence Relations and Calendars
Multi-valued decision diagram	MDD archive for boosting the Pareto constraint
Multivalued Decision Diagrams	Partitioning a Map into Homogeneous Contiguous Regions: A Branch-and-Bound approach Using Decision Diagrams
N
Numeric Data	SAT-Based Learning of Compact Binary Decision Diagrams for Classification
O
Optimisation	Predict-then-Optimise Strategies for Water Flow Control
Optimization	Optimization models for pickup and delivery problems with reconfigurable capacities Distribution Optimization in Constraint Programming
P
p-dispersion	The p-dispersion problem with distance constraints
parallel algorithm	Symmetries for cube-and-conquer in finite model finding
Pareto optimality	MDD archive for boosting the Pareto constraint
Partial preemption	Partially Preemptive Multi Skill/Mode Resource-constrained Project Scheduling with Generalized Precedence Relations and Calendars
partially spatially balanced Latin rectangles	A New Approach to Generating 2 x n Partially Spatially Balanced Latin Rectangles
Pickup and delivery	Optimization models for pickup and delivery problems with reconfigurable capacities
polygon cover	Constraint Model for the Satellite Image Mosaic Selection Problem
Polynomial Equivalence	Binary Constraint Trees and Structured Decomposability
Preemptive Resources	An Efficient Constraint Programming Approach for Scheduling Interruptible Tasks Requiring Disjoint Disjunctive Resources
preprocessing	Preprocessing in SAT-Based Multi-Objective Combinatorial Optimization
Probabilistic Network	Probabilistic Inference by Projected Weighted Model Counting on Horn Clauses
Problem Drift	Addressing problem drift in the UNHCR fund allocation problem
Profile	Horizontally Elastic Edge Finder Rule for Cumulative Constraint Based on Slack and Density
proof logging
propagation	Simplifying Step-wise Explanation Sequences
Pseudo-Boolean Optimization	Towards More Efficient Local Search for Pseudo-Boolean Optimization Improving Local Search for Pseudo Boolean Optimization by Deep Optimization
Pseudo-Boolean Reasoning	Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning
Q
Quantified Boolean Formulas	Enumerative Level-2 Solution Counting for Quantified Boolean Formulas
Quantum computing	Constraint programming models for depth-optimal qubit assignment and SWAP-based routing
Qubit routing	Constraint programming models for depth-optimal qubit assignment and SWAP-based routing
R
random variables	Distribution Optimization in Constraint Programming
Redcap	Partitioning a Map into Homogeneous Contiguous Regions: A Branch-and-Bound approach Using Decision Diagrams
redundancy	Preprocessing in SAT-Based Multi-Objective Combinatorial Optimization
Regionalization	Partitioning a Map into Homogeneous Contiguous Regions: A Branch-and-Bound approach Using Decision Diagrams
Resource calendars	Partially Preemptive Multi Skill/Mode Resource-constrained Project Scheduling with Generalized Precedence Relations and Calendars
S
SAT encodings	Proven optimally-balanced Latin rectangles with SAT
SAT solving	Searching for smallest universal graphs and tournaments with SAT
satellite imaging	Constraint Model for the Satellite Image Mosaic Selection Problem
Saturation	Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning
Scheduling	An Efficient Constraint Programming Approach for Scheduling Interruptible Tasks Requiring Disjoint Disjunctive Resources Optimization of Short-Term Underground Mine Planning using Constraint Programming
Scoring Function	Towards More Efficient Local Search for Pseudo-Boolean Optimization
Search	Guiding Backtrack Search by Tracking Variables during Constraint Propagation
set cover	Constraint Model for the Satellite Image Mosaic Selection Problem
Short-term planning	Optimization of Short-Term Underground Mine Planning using Constraint Programming
Solution Counting	Enumerative Level-2 Solution Counting for Quantified Boolean Formulas
Solving	A CP Approach for the Liner Shipping Network Design Problem
spatially balanced Latin rectangles	Proven optimally-balanced Latin rectangles with SAT
State Space Search	Large Neighborhood Beam Search for Domain-Independent Dynamic Programming
Stochastic	Distribution Optimization in Constraint Programming
Stochastic Local Search	Towards More Efficient Local Search for Pseudo-Boolean Optimization
Structured Decomposability	Binary Constraint Trees and Structured Decomposability
Strucured DNNF	Binary Constraint Trees and Structured Decomposability
subgraph isomorphism	Searching for smallest universal graphs and tournaments with SAT
symmetry breaking	Searching for smallest universal graphs and tournaments with SAT
symmetry-breaking	Symmetries for cube-and-conquer in finite model finding
T
TimeTable	Horizontally Elastic Edge Finder Rule for Cumulative Constraint Based on Slack and Density
tournament	Searching for smallest universal graphs and tournaments with SAT
Transfer Hub Network	Constraint Programming to Improve Hub Utilization in Autonomous Transfer Hub Networks
U
under-approximation	Constraint Programming with External Worst-Case Traversal Time Analysis
Underground mine	Optimization of Short-Term Underground Mine Planning using Constraint Programming
User feedback	Incremental Constrained Clustering by Minimal Weighted Modification
V
Variable Ordering Heuristics	Guiding Backtrack Search by Tracking Variables during Constraint Propagation
Variable Weighting	Guiding Backtrack Search by Tracking Variables during Constraint Propagation
W
Water flow control	Predict-then-Optimise Strategies for Water Flow Control
Weighting Scheme	Towards More Efficient Local Search for Pseudo-Boolean Optimization

Disclaimer | Powered by EasyChair Smart Program