LIPIcs, Volume 280, CP 2023

• Roland H. C. Yap LIPIcs, Volume 280, CP 2023, Complete Volume 10.4230/LIPIcs.CP.2023
• Roland H. C. Yap Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.CP.2023.0
• Maria Garcia de la Banda Beyond Optimal Solutions for Real-World Problems (Invited Talk) 10.4230/LIPIcs.CP.2023.1
• Jimmy H.M. Lee A Tale of Two Cities: Teaching CP with Story-Telling (Invited Talk) 10.4230/LIPIcs.CP.2023.2
• Laurent Perron, Frédéric Didier, and Steven Gay The CP-SAT-LP Solver (Invited Talk) 10.4230/LIPIcs.CP.2023.3
• Thomas Schiex Coupling CP with Deep Learning for Molecular Design and SARS-CoV2 Variants Exploration (Invited Talk) 10.4230/LIPIcs.CP.2023.4
• Petr Vilím CP Solver Design for Maximum CPU Utilization (Invited Talk) 10.4230/LIPIcs.CP.2023.5
• Younes Aalian, Gilles Pesant, and Michel Gamache Optimization of Short-Term Underground Mine Planning Using Constraint Programming 10.4230/LIPIcs.CP.2023.6
• Josep Alòs, Carlos Ansótegui, Josep M. Salvia, and Eduard Torres Exploiting Configurations of MaxSAT Solvers 10.4230/LIPIcs.CP.2023.7
• João Araújo, Choiwah Chow, and Mikoláš Janota Symmetries for Cube-And-Conquer in Finite Model Finding 10.4230/LIPIcs.CP.2023.8
• Gilles Audemard, Christophe Lecoutre, and Charles Prud'homme Guiding Backtrack Search by Tracking Variables During Constraint Propagation 10.4230/LIPIcs.CP.2023.9
• Aymeric Beauchamp, Thi-Bich-Hanh Dao, Samir Loudni, and Christel Vrain Incremental Constrained Clustering by Minimal Weighted Modification 10.4230/LIPIcs.CP.2023.10
• Ignace Bleukx, Jo Devriendt, Emilio Gamba, Bart Bogaerts, and Tias Guns Simplifying Step-Wise Explanation Sequences 10.4230/LIPIcs.CP.2023.11
• Yi Chu, Shaowei Cai, Chuan Luo, Zhendong Lei, and Cong Peng Towards More Efficient Local Search for Pseudo-Boolean Optimization 10.4230/LIPIcs.CP.2023.12
• Vianney Coppé, Xavier Gillard, and Pierre Schaus Boosting Decision Diagram-Based Branch-And-Bound by Pre-Solving with Aggregate Dynamic Programming 10.4230/LIPIcs.CP.2023.13
• Arnaud Deza, Chang Liu, Pashootan Vaezipoor, and Elias B. Khalil Fast Matrix Multiplication Without Tears: A Constraint Programming Approach 10.4230/LIPIcs.CP.2023.14
• Alexandre Dubray, Pierre Schaus, and Siegfried Nijssen Probabilistic Inference by Projected Weighted Model Counting on Horn Clauses 10.4230/LIPIcs.CP.2023.15
• Yousra El Ghazi, Djamal Habet, and Cyril Terrioux A CP Approach for the Liner Shipping Network Design Problem 10.4230/LIPIcs.CP.2023.16
• Arnoosh Golestanian, Giovanni Lo Bianco, Chengyu Tao, and J. Christopher Beck Optimization Models for Pickup-And-Delivery Problems with Reconfigurable Capacities 10.4230/LIPIcs.CP.2023.17
• Christoph Jabs, Jeremias Berg, Hannes Ihalainen, and Matti Järvisalo Preprocessing in SAT-Based Multi-Objective Combinatorial Optimization 10.4230/LIPIcs.CP.2023.18
• Carla Juvin, Emmanuel Hebrard, Laurent Houssin, and Pierre Lopez An Efficient Constraint Programming Approach to Preemptive Job Shop Scheduling 10.4230/LIPIcs.CP.2023.19
• Roger Kameugne, Sévérine Fetgo Betmbe, Thierry Noulamo, and Clémentin Tayou Djamegni Horizontally Elastic Edge Finder Rule for Cumulative Constraint Based on Slack and Density 10.4230/LIPIcs.CP.2023.20
• Matthias Klapperstueck, Frits de Nijs, Ilankaikone Senthooran, Jack Lee-Kopij, Maria Garcia de la Banda, and Michael Wybrow Exploring Hydrogen Supply/Demand Networks: Modeller and Domain Expert Views 10.4230/LIPIcs.CP.2023.21
• Petr Kučera Binary Constraint Trees and Structured Decomposability 10.4230/LIPIcs.CP.2023.22
• Ryo Kuroiwa and J. Christopher Beck Large Neighborhood Beam Search for Domain-Independent Dynamic Programming 10.4230/LIPIcs.CP.2023.23
• Steve Malalel, Arnaud Malapert, Marie Pelleau, and Jean-Charles Régin MDD Archive for Boosting the Pareto Constraint 10.4230/LIPIcs.CP.2023.24
• Tom Marty, Tristan François, Pierre Tessier, Louis Gautier, Louis-Martin Rousseau, and Quentin Cappart Learning a Generic Value-Selection Heuristic Inside a Constraint Programming Solver 10.4230/LIPIcs.CP.2023.25
• Matthew J. McIlree and Ciaran McCreesh Proof Logging for Smart Extensional Constraints 10.4230/LIPIcs.CP.2023.26
• Gioni Mexi, Timo Berthold, Ambros Gleixner, and Jakob Nordström Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning 10.4230/LIPIcs.CP.2023.27
• Xiao Peng and Christine Solnon Using Canonical Codes to Efficiently Solve the Benzenoid Generation Problem with Constraint Programming 10.4230/LIPIcs.CP.2023.28
• Guillaume Perez, Gaël Glorian, Wijnand Suijlen, and Arnaud Lallouet Distribution Optimization in Constraint Programming 10.4230/LIPIcs.CP.2023.29
• Nikolaos Ploskas, Kostas Stergiou, and Dimosthenis C. Tsouros The p-Dispersion Problem with Distance Constraints 10.4230/LIPIcs.CP.2023.30
• Guillaume Povéda, Nahum Alvarez, and Christian Artigues Partially Preemptive Multi Skill/Mode Resource-Constrained Project Scheduling with Generalized Precedence Relations and Calendars 10.4230/LIPIcs.CP.2023.31
• Stéphanie Roussel, Thomas Polacsek, and Anouck Chan Assembly Line Preliminary Design Optimization for an Aircraft 10.4230/LIPIcs.CP.2023.32
• Pouya Shati, Eldan Cohen, and Sheila McIlraith SAT-Based Learning of Compact Binary Decision Diagrams for Classification 10.4230/LIPIcs.CP.2023.33
• Pierre Talbot, Tingting Hu, and Nicolas Navet Constraint Programming with External Worst-Case Traversal Time Analysis 10.4230/LIPIcs.CP.2023.34
• Van-Giang Trinh, Belaid Benhamou, and Sylvain Soliman Efficient Enumeration of Fixed Points in Complex Boolean Networks Using Answer Set Programming 10.4230/LIPIcs.CP.2023.35
• Dimosthenis C. Tsouros, Senne Berden, and Tias Guns Guided Bottom-Up Interactive Constraint Acquisition 10.4230/LIPIcs.CP.2023.36
• Sameela Suharshani Wijesundara, Maria Garcia de la Banda, and Guido Tack Addressing Problem Drift in UNHCR Fund Allocation 10.4230/LIPIcs.CP.2023.37
• Jinqiang Yu, Alexey Ignatiev, and Peter J. Stuckey From Formal Boosted Tree Explanations to Interpretable Rule Sets 10.4230/LIPIcs.CP.2023.38
• Tianwei Zhang and Stefan Szeider Searching for Smallest Universal Graphs and Tournaments with SAT 10.4230/LIPIcs.CP.2023.39
• Kexin Zheng, Ang Li, Han Zhang, and T. K. Satish Kumar FastMapSVM for Predicting CSP Satisfiability 10.4230/LIPIcs.CP.2023.40
• Wenbo Zhou, Yujiao Zhao, Yiyuan Wang, Shaowei Cai, Shimao Wang, Xinyu Wang, and Minghao Yin Improving Local Search for Pseudo Boolean Optimization by Fragile Scoring Function and Deep Optimization 10.4230/LIPIcs.CP.2023.41
• Vincent Barbosa Vaz, James Bailey, Christopher Leckie, and Peter J. Stuckey Predict-Then-Optimise Strategies for Water Flow Control (Short Paper) 10.4230/LIPIcs.CP.2023.42
• Kyle E. C. Booth Constraint Programming Models for Depth-Optimal Qubit Assignment and SWAP-Based Routing (Short Paper) 10.4230/LIPIcs.CP.2023.43
• Manuel Combarro Simón, Pierre Talbot, Grégoire Danoy, Jedrzej Musial, Mohammed Alswaitti, and Pascal Bouvry Constraint Model for the Satellite Image Mosaic Selection Problem (Short Paper) 10.4230/LIPIcs.CP.2023.44
• Nicolas Golenvaux, Xavier Gillard, Siegfried Nijssen, and Pierre Schaus Partitioning a Map into Homogeneous Contiguous Regions: A Branch-And-Bound Approach Using Decision Diagrams (Short Paper) 10.4230/LIPIcs.CP.2023.45
• Chungjae Lee, Wirattawut Boonbandansook, Vahid Eghbal Akhlaghi, Kevin Dalmeijer, and Pascal Van Hentenryck Constraint Programming to Improve Hub Utilization in Autonomous Transfer Hub Networks (Short Paper) 10.4230/LIPIcs.CP.2023.46
• Renee Mirka, Laura Greenstreet, Marc Grimson, and Carla P. Gomes A New Approach to Finding 2 x n Partially Spatially Balanced Latin Rectangles (Short Paper) 10.4230/LIPIcs.CP.2023.47
• Vaidyanathan Peruvemba Ramaswamy and Stefan Szeider Proven Optimally-Balanced Latin Rectangles with SAT (Short Paper) 10.4230/LIPIcs.CP.2023.48
• Andreas Plank, Sibylle Möhle, and Martina Seidl Enumerative Level-2 Solution Counting for Quantified Boolean Formulas (Short Paper) 10.4230/LIPIcs.CP.2023.49