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