10.1145/acmotherconferences
ACM Other Conferences
0000000
10.5555/0000000
Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming (CP 2021)
CP 2021
https://orcid.org/0000-0001-7230-7130
Michel
Laurent D.
University of Connecticut, USA
laurent.michel@uconn.edu
Editor
15
10
2021
9783959772112
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
PUB7509
Germany
2021
25
10
2021
29
10
2021
CP 2021: 27th International Conference on Principles and Practice of Constraint Programming (CP 2021)
CP 2021
The Bi-Objective Long-Haul Transportation Problem on a Road Network (Invited Talk)
10.4230/LIPIcs.CP.2021.1
1
Constrained-Based Differential Privacy (Invited Talk)
10.4230/LIPIcs.CP.2021.2
2
Learning in Local Branching (Invited Talk)
10.4230/LIPIcs.CP.2021.3
3
Filtering Isomorphic Models by Invariants (Short Paper)
10.4230/LIPIcs.CP.2021.4
4
Improving Local Search for Structured SAT Formulas via Unit Propagation Based Construct and Cut Initialization (Short Paper)
10.4230/LIPIcs.CP.2021.5
5
Unit Propagation with Stable Watches (Short Paper)
10.4230/LIPIcs.CP.2021.6
6
Towards Better Heuristics for Solving Bounded Model Checking Problems (Short Paper)
10.4230/LIPIcs.CP.2021.7
7
Integrating Tree Decompositions into Decision Heuristics of Propositional Model Counters (Short Paper)
10.4230/LIPIcs.CP.2021.8
8
Failure Based Variable Ordering Heuristics for Solving CSPs (Short Paper)
10.4230/LIPIcs.CP.2021.9
9
Generating Magical Performances with Constraint Programming (Short Paper)
10.4230/LIPIcs.CP.2021.10
10
Vehicle Dynamics in Pickup-And-Delivery Problems Using Electric Vehicles
10.4230/LIPIcs.CP.2021.11
11
Building High Strength Mixed Covering Arrays with Constraints
10.4230/LIPIcs.CP.2021.12
12
On How Turing and Singleton Arc Consistency Broke the Enigma Code
10.4230/LIPIcs.CP.2021.13
13
Combining Monte Carlo Tree Search and Depth First Search Methods for a Car Manufacturing Workshop Scheduling Problem
10.4230/LIPIcs.CP.2021.14
14
Practical Bigraphs via Subgraph Isomorphism
10.4230/LIPIcs.CP.2021.15
15
The Hybrid Flexible Flowshop with Transportation Times
10.4230/LIPIcs.CP.2021.16
16
CLR-DRNets: Curriculum Learning with Restarts to Solve Visual Combinatorial Games
10.4230/LIPIcs.CP.2021.17
17
An Interval Constraint Programming Approach for Quasi Capture Tube Validation
10.4230/LIPIcs.CP.2021.18
18
Exhaustive Generation of Benzenoid Structures Sharing Common Patterns
10.4230/LIPIcs.CP.2021.19
19
Combining VSIDS and CHB Using Restarts in SAT
10.4230/LIPIcs.CP.2021.20
20
On the Tractability of Explaining Decisions of Classifiers
10.4230/LIPIcs.CP.2021.21
21
A Collection of Constraint Programming Models for the Three-Dimensional Stable Matching Problem with Cyclic Preferences
10.4230/LIPIcs.CP.2021.22
22
Bounds on Weighted CSPs Using Constraint Propagation and Super-Reparametrizations
10.4230/LIPIcs.CP.2021.23
23
Parallel Model Counting with CUDA: Algorithm Engineering for Efficient Hardware Utilization
10.4230/LIPIcs.CP.2021.24
24
Complications for Computational Experiments from Modern Processors
10.4230/LIPIcs.CP.2021.25
25
A Job Dispatcher for Large and Heterogeneous HPC Systems Running Modern Applications
10.4230/LIPIcs.CP.2021.26
26
The Dungeon Variations Problem Using Constraint Programming
10.4230/LIPIcs.CP.2021.27
27
Refined Core Relaxation for Core-Guided MaxSAT Solving
10.4230/LIPIcs.CP.2021.28
28
A Linear Time Algorithm for the k-Cutset Constraint
10.4230/LIPIcs.CP.2021.29
29
A k-Opt Based Constraint for the TSP
10.4230/LIPIcs.CP.2021.30
30
The Seesaw Algorithm: Function Optimization Using Implicit Hitting Sets
10.4230/LIPIcs.CP.2021.31
31
Reasoning Short Cuts in Infinite Domain Constraint Satisfaction: Algorithms and Lower Bounds for Backdoors
10.4230/LIPIcs.CP.2021.32
32
Learning TSP Requires Rethinking Generalization
10.4230/LIPIcs.CP.2021.33
33
SAT Modulo Symmetries for Graph Generation
10.4230/LIPIcs.CP.2021.34
34
Counterfactual Explanations via Inverse Constraint Programming
10.4230/LIPIcs.CP.2021.35
35
Utilizing Constraint Optimization for Industrial Machine Workload Balancing
10.4230/LIPIcs.CP.2021.36
36
Minimizing Cumulative Batch Processing Time for an Industrial Oven Scheduling Problem
10.4230/LIPIcs.CP.2021.37
37
Combining Clause Learning and Branch and Bound for MaxSAT
10.4230/LIPIcs.CP.2021.38
38
Improving Local Search for Minimum Weighted Connected Dominating Set Problem by Inner-Layer Local Search
10.4230/LIPIcs.CP.2021.39
39
Automatic Generation of Declarative Models For Differential Cryptanalysis
10.4230/LIPIcs.CP.2021.40
40
A Bound-Independent Pruning Technique to Speeding up Tree-Based Complete Search Algorithms for Distributed Constraint Optimization Problems
10.4230/LIPIcs.CP.2021.41
41
Data Driven VRP: A Neural Network Model to Learn Hidden Preferences for VRP
10.4230/LIPIcs.CP.2021.42
42
Statistical Comparison of Algorithm Performance Through Instance Selection
10.4230/LIPIcs.CP.2021.43
43
Enabling Incrementality in the Implicit Hitting Set Approach to MaxSAT Under Changing Weights
10.4230/LIPIcs.CP.2021.44
44
Solving the Non-Crossing MAPF with CP
10.4230/LIPIcs.CP.2021.45
45
Positive and Negative Length-Bound Reachability Constraints
10.4230/LIPIcs.CP.2021.46
46
Evaluating the Hardness of SAT Instances Using Evolutionary Optimization Algorithms
10.4230/LIPIcs.CP.2021.47
47
Optimising Training for Service Delivery
10.4230/LIPIcs.CP.2021.48
48
Human-Centred Feasibility Restoration
10.4230/LIPIcs.CP.2021.49
49
SAT-Based Approach for Learning Optimal Decision Trees with Non-Binary Features
10.4230/LIPIcs.CP.2021.50
50
Pseudo-Boolean Optimization by Implicit Hitting Sets
10.4230/LIPIcs.CP.2021.51
51
An Algorithm-Independent Measure of Progress for Linear Constraint Propagation
10.4230/LIPIcs.CP.2021.52
52
Differential Programming via OR Methods
10.4230/LIPIcs.CP.2021.53
53
Learning Max-CSPs via Active Constraint Acquisition
10.4230/LIPIcs.CP.2021.54
54
Parallelizing a SAT-Based Product Configurator
10.4230/LIPIcs.CP.2021.55
55
Solution Sampling with Random Table Constraints
10.4230/LIPIcs.CP.2021.56
56
Making Rigorous Linear Programming Practical for Program Analysis
10.4230/LIPIcs.CP.2021.57
57
Engineering an Efficient PB-XOR Solver
10.4230/LIPIcs.CP.2021.58
58
Automated Random Testing of Numerical Constrained Types
10.4230/LIPIcs.CP.2021.59
59
The Effect of Asynchronous Execution and Message Latency on Max-Sum
10.4230/LIPIcs.CP.2021.60
60