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

A
Aalian, Younes	Optimization of Short-Term Underground Mine Planning using Constraint Programming
Alswaitti, Mohammed	Constraint Model for the Satellite Image Mosaic Selection Problem
Alvarez, Nahum	Partially Preemptive Multi Skill/Mode Resource-constrained Project Scheduling with Generalized Precedence Relations and Calendars
Alòs, Josep	Exploiting Configurations of MaxSAT solvers
Ansótegui, Carlos	Exploiting Configurations of MaxSAT solvers
Araújo, João	Symmetries for cube-and-conquer in finite model finding
Artigues, Christian	Partially Preemptive Multi Skill/Mode Resource-constrained Project Scheduling with Generalized Precedence Relations and Calendars
Audemard, Gilles	Guiding Backtrack Search by Tracking Variables during Constraint Propagation
B
Bailey, James	Predict-then-Optimise Strategies for Water Flow Control
Barbosa Vaz, Vincent	Predict-then-Optimise Strategies for Water Flow Control
Beauchamp, Aymeric	Incremental Constrained Clustering by Minimal Weighted Modification
Beck, J. Christopher	Large Neighborhood Beam Search for Domain-Independent Dynamic Programming Optimization models for pickup and delivery problems with reconfigurable capacities
Benhamou, Belaid	Efficient enumeration of fixed points in complex Boolean networks using answer set programming
Berden, Senne	Guided Bottom-Up Interactive Constraint Acquisition
Berg, Jeremias	Preprocessing in SAT-Based Multi-Objective Combinatorial Optimization
Berthold, Timo	Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning
Bianco, Giovanni Lo	Optimization models for pickup and delivery problems with reconfigurable capacities
Bleukx, Ignace	Simplifying Step-wise Explanation Sequences
Bogaerts, Bart	Simplifying Step-wise Explanation Sequences
Boonbandansook, Wirattawut	Constraint Programming to Improve Hub Utilization in Autonomous Transfer Hub Networks
Booth, Kyle E. C.	Constraint programming models for depth-optimal qubit assignment and SWAP-based routing
Bouvry, Pascal	Constraint Model for the Satellite Image Mosaic Selection Problem
C
Cai, Shaowei	Improving Local Search for Pseudo Boolean Optimization by Deep Optimization Towards More Efficient Local Search for Pseudo-Boolean Optimization
Cappart, Quentin	Learning a Generic Value-Selection Heuristic Inside a Generic Constraint Programming Solver
Chan, Anouck	Assembly Line Preliminary Design Optimization for an Aircraft Airframe
Chow, Choiwah	Symmetries for cube-and-conquer in finite model finding
Chu, Yi	Towards More Efficient Local Search for Pseudo-Boolean Optimization
Cohen, Eldan	SAT-Based Learning of Compact Binary Decision Diagrams for Classification
Combarro Simon, Manuel	Constraint Model for the Satellite Image Mosaic Selection Problem
Coppé, Vianney	Boosting Decision Diagram-Based Branch-and-Bound by Pre-Solving with Aggregate Dynamic Programming
D
Dalmeijer, Kevin	Constraint Programming to Improve Hub Utilization in Autonomous Transfer Hub Networks
Danoy, Grégoire	Constraint Model for the Satellite Image Mosaic Selection Problem
Dao, Thi-Bich-Hanh	Incremental Constrained Clustering by Minimal Weighted Modification
Devriendt, Jo	Simplifying Step-wise Explanation Sequences
Deza, Arnaud	Fast Matrix Multiplication Without Tears: A Constraint Programming Approach
Dubray, Alexandre	Probabilistic Inference by Projected Weighted Model Counting on Horn Clauses
E
Eghbal Akhlaghi, Vahid	Constraint Programming to Improve Hub Utilization in Autonomous Transfer Hub Networks
El Ghazi, Yousra	A CP Approach for the Liner Shipping Network Design Problem
F
Fetgo Betmbe, Sévérine	Horizontally Elastic Edge Finder Rule for Cumulative Constraint Based on Slack and Density
François, Tristan	Learning a Generic Value-Selection Heuristic Inside a Generic Constraint Programming Solver
G
Gamache, Michel	Optimization of Short-Term Underground Mine Planning using Constraint Programming
Gamba, Emilio	Simplifying Step-wise Explanation Sequences
Garcia De La Banda, Maria	Addressing problem drift in the UNHCR fund allocation problem
Gautier, Louis	Learning a Generic Value-Selection Heuristic Inside a Generic Constraint Programming Solver
Gillard, Xavier	Partitioning a Map into Homogeneous Contiguous Regions: A Branch-and-Bound approach Using Decision Diagrams Boosting Decision Diagram-Based Branch-and-Bound by Pre-Solving with Aggregate Dynamic Programming
Gleixner, Ambros	Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning
Glorian, Gael	Distribution Optimization in Constraint Programming
Golenvaux, Nicolas	Partitioning a Map into Homogeneous Contiguous Regions: A Branch-and-Bound approach Using Decision Diagrams
Golestanian, Arnoosh	Optimization models for pickup and delivery problems with reconfigurable capacities
Gomes, Carla	A New Approach to Generating 2 x n Partially Spatially Balanced Latin Rectangles
Greenstreet, Laura	A New Approach to Generating 2 x n Partially Spatially Balanced Latin Rectangles
Grimson, Marc	A New Approach to Generating 2 x n Partially Spatially Balanced Latin Rectangles
Guns, Tias	Simplifying Step-wise Explanation Sequences Guided Bottom-Up Interactive Constraint Acquisition
H
Habet, Djamal	A CP Approach for the Liner Shipping Network Design Problem
Hebrard, Emmanuel	An Efficient Constraint Programming Approach for Scheduling Interruptible Tasks Requiring Disjoint Disjunctive Resources
Houssin, Laurent	An Efficient Constraint Programming Approach for Scheduling Interruptible Tasks Requiring Disjoint Disjunctive Resources
Hu, Tingting	Constraint Programming with External Worst-Case Traversal Time Analysis
I
Ignatiev, Alexey	From Formal Boosted Tree Explanations to Interpretable Rule Sets
Ihalainen, Hannes	Preprocessing in SAT-Based Multi-Objective Combinatorial Optimization
J
Jabs, Christoph	Preprocessing in SAT-Based Multi-Objective Combinatorial Optimization
Janota, Mikolas	Symmetries for cube-and-conquer in finite model finding
Juvin, Carla	An Efficient Constraint Programming Approach for Scheduling Interruptible Tasks Requiring Disjoint Disjunctive Resources
Järvisalo, Matti	Preprocessing in SAT-Based Multi-Objective Combinatorial Optimization
K
Kameugne, Roger	Horizontally Elastic Edge Finder Rule for Cumulative Constraint Based on Slack and Density
Khalil, Elias	Fast Matrix Multiplication Without Tears: A Constraint Programming Approach
Kucera, Petr	Binary Constraint Trees and Structured Decomposability
Kumar, T. K. Satish	FastMapSVM for Predicting CSP Satisfiability
Kuroiwa, Ryo	Large Neighborhood Beam Search for Domain-Independent Dynamic Programming
L
Lallouet, Arnaud	Distribution Optimization in Constraint Programming
Leckie, Chris	Predict-then-Optimise Strategies for Water Flow Control
Lecoutre, Christophe	Guiding Backtrack Search by Tracking Variables during Constraint Propagation
Lee, Chungjae	Constraint Programming to Improve Hub Utilization in Autonomous Transfer Hub Networks
Lei, Zhendong	Towards More Efficient Local Search for Pseudo-Boolean Optimization
Li, Ang	FastMapSVM for Predicting CSP Satisfiability
Liu, Chang	Fast Matrix Multiplication Without Tears: A Constraint Programming Approach
Lopez, Pierre	An Efficient Constraint Programming Approach for Scheduling Interruptible Tasks Requiring Disjoint Disjunctive Resources
Loudni, Samir	Incremental Constrained Clustering by Minimal Weighted Modification
Luo, Chuan	Towards More Efficient Local Search for Pseudo-Boolean Optimization
M
Malalel, Steve	MDD archive for boosting the Pareto constraint
Malapert, Arnaud	MDD archive for boosting the Pareto constraint
Marty, Tom	Learning a Generic Value-Selection Heuristic Inside a Generic Constraint Programming Solver
McIlraith, Sheila	SAT-Based Learning of Compact Binary Decision Diagrams for Classification
Mexi, Gioni	Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning
Mirka, Renee	A New Approach to Generating 2 x n Partially Spatially Balanced Latin Rectangles
Musial, Jedrzej	Constraint Model for the Satellite Image Mosaic Selection Problem
Möhle, Sibylle	Enumerative Level-2 Solution Counting for Quantified Boolean Formulas
N
Navet, Nicolas	Constraint Programming with External Worst-Case Traversal Time Analysis
Nijssen, Siegfried	Probabilistic Inference by Projected Weighted Model Counting on Horn Clauses Partitioning a Map into Homogeneous Contiguous Regions: A Branch-and-Bound approach Using Decision Diagrams
Nordstrom, Jakob	Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning
Noulamo, Thierry	Horizontally Elastic Edge Finder Rule for Cumulative Constraint Based on Slack and Density
P
P. R., Vaidyanathan	Proven optimally-balanced Latin rectangles with SAT
Pelleau, Marie	MDD archive for boosting the Pareto constraint
Peng, Cong	Towards More Efficient Local Search for Pseudo-Boolean Optimization
Peng, Xiao	Using Canonical Codes to Efficiently Solve the Benzenoid Generation Problem with Constraint Programming
Perez, Guillaume	Distribution Optimization in Constraint Programming
Pesant, Gilles	Optimization of Short-Term Underground Mine Planning using Constraint Programming
Plank, Andreas	Enumerative Level-2 Solution Counting for Quantified Boolean Formulas
Ploskas, Nikolaos	The p-dispersion problem with distance constraints
Polacsek, Thomas	Assembly Line Preliminary Design Optimization for an Aircraft Airframe
Poveda, Guillaume	Partially Preemptive Multi Skill/Mode Resource-constrained Project Scheduling with Generalized Precedence Relations and Calendars
Prud'Homme, Charles	Guiding Backtrack Search by Tracking Variables during Constraint Propagation
R
Regin, Jean-Charles	MDD archive for boosting the Pareto constraint
Rousseau, Louis-Martin	Learning a Generic Value-Selection Heuristic Inside a Generic Constraint Programming Solver
Roussel, Stephanie	Assembly Line Preliminary Design Optimization for an Aircraft Airframe
S
Salvia Hornos, Josep Maria	Exploiting Configurations of MaxSAT solvers
Schaus, Pierre	Probabilistic Inference by Projected Weighted Model Counting on Horn Clauses Partitioning a Map into Homogeneous Contiguous Regions: A Branch-and-Bound approach Using Decision Diagrams Boosting Decision Diagram-Based Branch-and-Bound by Pre-Solving with Aggregate Dynamic Programming
Seidl, Martina	Enumerative Level-2 Solution Counting for Quantified Boolean Formulas
Shati, Pouya	SAT-Based Learning of Compact Binary Decision Diagrams for Classification
Soliman, Sylvain	Efficient enumeration of fixed points in complex Boolean networks using answer set programming
Solnon, Christine	Using Canonical Codes to Efficiently Solve the Benzenoid Generation Problem with Constraint Programming
Stergiou, Kostas	The p-dispersion problem with distance constraints
Stuckey, Peter J.	From Formal Boosted Tree Explanations to Interpretable Rule Sets Predict-then-Optimise Strategies for Water Flow Control
Suijlen, Wijnand	Distribution Optimization in Constraint Programming
Szeider, Stefan	Searching for smallest universal graphs and tournaments with SAT Proven optimally-balanced Latin rectangles with SAT
T
Tack, Guido	Addressing problem drift in the UNHCR fund allocation problem
Talbot, Pierre	Constraint Model for the Satellite Image Mosaic Selection Problem Constraint Programming with External Worst-Case Traversal Time Analysis
Tao, Chengyu	Optimization models for pickup and delivery problems with reconfigurable capacities
Tayou Djamegni, Clémentin	Horizontally Elastic Edge Finder Rule for Cumulative Constraint Based on Slack and Density
Terrioux, Cyril	A CP Approach for the Liner Shipping Network Design Problem
Tessier, Pierre	Learning a Generic Value-Selection Heuristic Inside a Generic Constraint Programming Solver
Torres Montiel, Eduard	Exploiting Configurations of MaxSAT solvers
Trinh, Van-Giang	Efficient enumeration of fixed points in complex Boolean networks using answer set programming
Tsouros, Dimosthenis C.	The p-dispersion problem with distance constraints Guided Bottom-Up Interactive Constraint Acquisition
V
Vaezipoor, Pashootan	Fast Matrix Multiplication Without Tears: A Constraint Programming Approach
Van Hentenryck, Pascal	Constraint Programming to Improve Hub Utilization in Autonomous Transfer Hub Networks
Vrain, Christel	Incremental Constrained Clustering by Minimal Weighted Modification
W
Wang, Shimao	Improving Local Search for Pseudo Boolean Optimization by Deep Optimization
Wang, Xinyu	Improving Local Search for Pseudo Boolean Optimization by Deep Optimization
Wang, Yiyuan	Improving Local Search for Pseudo Boolean Optimization by Deep Optimization
Wijesundara, Sameela	Addressing problem drift in the UNHCR fund allocation problem
Y
Yin, Minghao	Improving Local Search for Pseudo Boolean Optimization by Deep Optimization
Yu, Jinqiang	From Formal Boosted Tree Explanations to Interpretable Rule Sets
Z
Zhang, Han	FastMapSVM for Predicting CSP Satisfiability
Zhang, Tianwei	Searching for smallest universal graphs and tournaments with SAT
Zhao, Yujiao	Improving Local Search for Pseudo Boolean Optimization by Deep Optimization
Zheng, Kexin	FastMapSVM for Predicting CSP Satisfiability
Zhou, Wenbo	Improving Local Search for Pseudo Boolean Optimization by Deep Optimization

Disclaimer | Powered by EasyChair Smart Program