10.1145/acmotherconferences
ACM Other Conferences
0000000
10.5555/0000000
Proceedings of the 29th International Conference on Principles and Practice of Constraint Programming (CP 2023)
CP 2023
https://orcid.org/0000-0002-1188-7474
Yap
Roland H. C.
National University of Singapore, School of Computing, 13 Computing Drive, Singapore
ryap@comp.nus.edu.sg
Editor
22
09
2023
9783959773003
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
PUB7509
Germany
2023
27
08
2023
31
08
2023
CP 2023: 29th International Conference on Principles and Practice of Constraint Programming (CP 2023)
CP 2023
Beyond Optimal Solutions for Real-World Problems (Invited Talk)
10.4230/LIPIcs.CP.2023.1
1
A Tale of Two Cities: Teaching CP with Story-Telling (Invited Talk)
10.4230/LIPIcs.CP.2023.2
2
The CP-SAT-LP Solver (Invited Talk)
10.4230/LIPIcs.CP.2023.3
3
Coupling CP with Deep Learning for Molecular Design and SARS-CoV2 Variants Exploration (Invited Talk)
10.4230/LIPIcs.CP.2023.4
4
CP Solver Design for Maximum CPU Utilization (Invited Talk)
10.4230/LIPIcs.CP.2023.5
5
Optimization of Short-Term Underground Mine Planning Using Constraint Programming
10.4230/LIPIcs.CP.2023.6
6
Exploiting Configurations of MaxSAT Solvers
10.4230/LIPIcs.CP.2023.7
7
Symmetries for Cube-And-Conquer in Finite Model Finding
10.4230/LIPIcs.CP.2023.8
8
Guiding Backtrack Search by Tracking Variables During Constraint Propagation
10.4230/LIPIcs.CP.2023.9
9
Incremental Constrained Clustering by Minimal Weighted Modification
10.4230/LIPIcs.CP.2023.10
10
Simplifying Step-Wise Explanation Sequences
10.4230/LIPIcs.CP.2023.11
11
Towards More Efficient Local Search for Pseudo-Boolean Optimization
10.4230/LIPIcs.CP.2023.12
12
Boosting Decision Diagram-Based Branch-And-Bound by Pre-Solving with Aggregate Dynamic Programming
10.4230/LIPIcs.CP.2023.13
13
Fast Matrix Multiplication Without Tears: A Constraint Programming Approach
10.4230/LIPIcs.CP.2023.14
14
Probabilistic Inference by Projected Weighted Model Counting on Horn Clauses
10.4230/LIPIcs.CP.2023.15
15
A CP Approach for the Liner Shipping Network Design Problem
10.4230/LIPIcs.CP.2023.16
16
Optimization Models for Pickup-And-Delivery Problems with Reconfigurable Capacities
10.4230/LIPIcs.CP.2023.17
17
Preprocessing in SAT-Based Multi-Objective Combinatorial Optimization
10.4230/LIPIcs.CP.2023.18
18
An Efficient Constraint Programming Approach to Preemptive Job Shop Scheduling
10.4230/LIPIcs.CP.2023.19
19
Horizontally Elastic Edge Finder Rule for Cumulative Constraint Based on Slack and Density
10.4230/LIPIcs.CP.2023.20
20
Exploring Hydrogen Supply/Demand Networks: Modeller and Domain Expert Views
10.4230/LIPIcs.CP.2023.21
21
Binary Constraint Trees and Structured Decomposability
10.4230/LIPIcs.CP.2023.22
22
Large Neighborhood Beam Search for Domain-Independent Dynamic Programming
10.4230/LIPIcs.CP.2023.23
23
MDD Archive for Boosting the Pareto Constraint
10.4230/LIPIcs.CP.2023.24
24
Learning a Generic Value-Selection Heuristic Inside a Constraint Programming Solver
10.4230/LIPIcs.CP.2023.25
25
Proof Logging for Smart Extensional Constraints
10.4230/LIPIcs.CP.2023.26
26
Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning
10.4230/LIPIcs.CP.2023.27
27
Using Canonical Codes to Efficiently Solve the Benzenoid Generation Problem with Constraint Programming
10.4230/LIPIcs.CP.2023.28
28
Distribution Optimization in Constraint Programming
10.4230/LIPIcs.CP.2023.29
29
The p-Dispersion Problem with Distance Constraints
10.4230/LIPIcs.CP.2023.30
30
Partially Preemptive Multi Skill/Mode Resource-Constrained Project Scheduling with Generalized Precedence Relations and Calendars
10.4230/LIPIcs.CP.2023.31
31
Assembly Line Preliminary Design Optimization for an Aircraft
10.4230/LIPIcs.CP.2023.32
32
SAT-Based Learning of Compact Binary Decision Diagrams for Classification
10.4230/LIPIcs.CP.2023.33
33
Constraint Programming with External Worst-Case Traversal Time Analysis
10.4230/LIPIcs.CP.2023.34
34
Efficient Enumeration of Fixed Points in Complex Boolean Networks Using Answer Set Programming
10.4230/LIPIcs.CP.2023.35
35
Guided Bottom-Up Interactive Constraint Acquisition
10.4230/LIPIcs.CP.2023.36
36
Addressing Problem Drift in UNHCR Fund Allocation
10.4230/LIPIcs.CP.2023.37
37
From Formal Boosted Tree Explanations to Interpretable Rule Sets
10.4230/LIPIcs.CP.2023.38
38
Searching for Smallest Universal Graphs and Tournaments with SAT
10.4230/LIPIcs.CP.2023.39
39
FastMapSVM for Predicting CSP Satisfiability
10.4230/LIPIcs.CP.2023.40
40
Improving Local Search for Pseudo Boolean Optimization by Fragile Scoring Function and Deep Optimization
10.4230/LIPIcs.CP.2023.41
41
Predict-Then-Optimise Strategies for Water Flow Control (Short Paper)
10.4230/LIPIcs.CP.2023.42
42
Constraint Programming Models for Depth-Optimal Qubit Assignment and SWAP-Based Routing (Short Paper)
10.4230/LIPIcs.CP.2023.43
43
Constraint Model for the Satellite Image Mosaic Selection Problem (Short Paper)
10.4230/LIPIcs.CP.2023.44
44
Partitioning a Map into Homogeneous Contiguous Regions: A Branch-And-Bound Approach Using Decision Diagrams (Short Paper)
10.4230/LIPIcs.CP.2023.45
45
Constraint Programming to Improve Hub Utilization in Autonomous Transfer Hub Networks (Short Paper)
10.4230/LIPIcs.CP.2023.46
46
A New Approach to Finding 2 x n Partially Spatially Balanced Latin Rectangles (Short Paper)
10.4230/LIPIcs.CP.2023.47
47
Proven Optimally-Balanced Latin Rectangles with SAT (Short Paper)
10.4230/LIPIcs.CP.2023.48
48
Enumerative Level-2 Solution Counting for Quantified Boolean Formulas (Short Paper)
10.4230/LIPIcs.CP.2023.49
49