LIPIcs, Volume 307, CP 2024

• Paul Shaw LIPIcs, Volume 307, CP 2024, Complete Volume 10.4230/LIPIcs.CP.2024
• Paul Shaw Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.CP.2024.0
• Ian P. Gent Solving Patience and Solitaire Games with Good Old Fashioned AI (Invited Talk) 10.4230/LIPIcs.CP.2024.1
• Francesca Rossi Thinking Fast and Slow in AI: A Cognitive Architecture to Augment Both AI and Human Reasoning (Invited Talk) 10.4230/LIPIcs.CP.2024.2
• Markus Anders, Sofia Brenner, and Gaurav Rattan The Complexity of Symmetry Breaking Beyond Lex-Leader 10.4230/LIPIcs.CP.2024.3
• Jeremias Berg, Bart Bogaerts, Jakob Nordström, Andy Oertel, Tobias Paxian, and Dieter Vandesande Certifying Without Loss of Generality Reasoning in Solution-Improving Maximum Satisfiability 10.4230/LIPIcs.CP.2024.4
• Zhihan Chen, Peng Lin, Hao Hu, and Shaowei Cai ParLS-PBO: A Parallel Local Search Solver for Pseudo Boolean Optimization 10.4230/LIPIcs.CP.2024.5
• Xiamin Chen, Zhendong Lei, and Pinyan Lu Deep Cooperation of Local Search and Unit Propagation Techniques 10.4230/LIPIcs.CP.2024.6
• Samuel Cloutier and Claude-Guy Quimper Cumulative Scheduling with Calendars and Overtime 10.4230/LIPIcs.CP.2024.7
• João Cortes, Inês Lynce, and Vasco Manquinho Slide&Drill, a New Approach for Multi-Objective Combinatorial Optimization 10.4230/LIPIcs.CP.2024.8
• Emir Demirović, Ciaran McCreesh, Matthew J. McIlree, Jakob Nordström, Andy Oertel, and Konstantin Sidorov Pseudo-Boolean Reasoning About States and Transitions to Certify Dynamic Programming and Decision Diagram Algorithms 10.4230/LIPIcs.CP.2024.9
• Alexandre Dubray, Pierre Schaus, and Siegfried Nijssen Anytime Weighted Model Counting with Approximation Guarantees for Probabilistic Inference 10.4230/LIPIcs.CP.2024.10
• Maarten Flippo, Konstantin Sidorov, Imko Marijnissen, Jeff Smits, and Emir Demirović A Multi-Stage Proof Logging Framework to Certify the Correctness of CP Solvers 10.4230/LIPIcs.CP.2024.11
• Adam Francis Green, J. Christopher Beck, and Amanda Coles Using Constraint Programming for Disjunctive Scheduling in Temporal AI Planning 10.4230/LIPIcs.CP.2024.12
• Cunjing Ge and Armin Biere Improved Bounds of Integer Solution Counts via Volume and Extending to Mixed-Integer Linear Constraints 10.4230/LIPIcs.CP.2024.13
• Panteleimon Iosif, Nikolaos Ploskas, Kostas Stergiou, and Dimosthenis C. Tsouros A CP/LS Heuristic Method for Maxmin and Minmax Location Problems with Distance Constraints 10.4230/LIPIcs.CP.2024.14
• Peter Jonsson, Victor Lagerkvist, and George Osipov CSPs with Few Alien Constraints 10.4230/LIPIcs.CP.2024.15
• Jihye Jung, Kevin Dalmeijer, and Pascal Van Hentenryck A New Optimization Model for Multiple-Control Toffoli Quantum Circuit Design 10.4230/LIPIcs.CP.2024.16
• Artem Kaznatcheev and Melle van Marle Exponential Steepest Ascent from Valued Constraint Graphs of Pathwidth Four 10.4230/LIPIcs.CP.2024.17
• Duc Anh Le, Stéphanie Roussel, Christophe Lecoutre, and Anouck Chan Learning Effect and Compound Activities in High Multiplicity RCPSP: Application to Satellite Production 10.4230/LIPIcs.CP.2024.18
• Peng Lin, Mengchuan Zou, and Shaowei Cai An Efficient Local Search Solver for Mixed Integer Programming 10.4230/LIPIcs.CP.2024.19
• Kostis Michailidis, Dimos Tsouros, and Tias Guns Constraint Modelling with LLMs Using In-Context Learning 10.4230/LIPIcs.CP.2024.20
• Mohsen Nafar and Michael Römer Strengthening Relaxed Decision Diagrams for Maximum Independent Set Problem: Novel Variable Ordering and Merge Heuristics 10.4230/LIPIcs.CP.2024.21
• Augustin Parjadis, Quentin Cappart, Bistra Dilkina, Aaron Ferber, and Louis-Martin Rousseau Learning Lagrangian Multipliers for the Travelling Salesman Problem 10.4230/LIPIcs.CP.2024.22
• Xavier Pucel and Stéphanie Roussel Constraint Programming Model for Assembly Line Balancing and Scheduling with Walking Workers and Parallel Stations 10.4230/LIPIcs.CP.2024.23
• Ben Rachmut, Roie Zivan, and William Yeoh Latency-Aware 2-Opt Monotonic Local Search for Distributed Constraint Optimization 10.4230/LIPIcs.CP.2024.24
• Florian Régin, Elisabetta De Maria, and Alexandre Bonlarron Combining Constraint Programming Reasoning with Large Language Model Predictions 10.4230/LIPIcs.CP.2024.25
• André Schidler and Stefan Szeider Structure-Guided Local Improvement for Maximum Satisfiability 10.4230/LIPIcs.CP.2024.26
• Margaux Schmied and Jean-Charles Régin Efficient Implementation of the Global Cardinality Constraint with Costs 10.4230/LIPIcs.CP.2024.27
• Fabio Tardivo, Laurent Michel, and Enrico Pontelli CP for Bin Packing with Multi-Core and GPUs 10.4230/LIPIcs.CP.2024.28
• Wout Vanroose, Ignace Bleukx, Jo Devriendt, Dimos Tsouros, Hélène Verhaeghe, and Tias Guns Mutational Fuzz Testing for Constraint Modeling Systems 10.4230/LIPIcs.CP.2024.29
• Hélène Verhaeghe, Quentin Cappart, Gilles Pesant, and Claude-Guy Quimper Learning Precedences for Scheduling Problems with Graph Neural Networks 10.4230/LIPIcs.CP.2024.30
• Oleg Zaikin Inverting Step-Reduced SHA-1 and MD5 by Parameterized SAT Solvers 10.4230/LIPIcs.CP.2024.31
• Jiachen Zhang and J. Christopher Beck Solving LBBD Master Problems with Constraint Programming and Domain-Independent Dynamic Programming 10.4230/LIPIcs.CP.2024.32
• Roie Zivan, Shiraz Regev, and William Yeoh Ex-Ante Constraint Elicitation in Incomplete DCOPs 10.4230/LIPIcs.CP.2024.33
• Sami Cherif, Heythem Sattoutah, Chu-Min Li, Corinne Lucet, and Laure Brisoux-Devendeville Minimizing Working-Group Conflicts in Conference Session Scheduling Through Maximum Satisfiability (Short Paper) 10.4230/LIPIcs.CP.2024.34
• Jorke M. de Vlas On the Complexity of Integer Programming with Fixed-Coefficient Scaling (Short Paper) 10.4230/LIPIcs.CP.2024.35
• Augustin Delecluse and Pierre Schaus Black-Box Value Heuristics for Solving Optimization Problems with Constraint Programming (Short Paper) 10.4230/LIPIcs.CP.2024.36
• Markus Kirchweger and Stefan Szeider Computing Small Rainbow Cycle Numbers with SAT Modulo Symmetries (Short Paper) 10.4230/LIPIcs.CP.2024.37
• Erdem Kuş, Özgür Akgün, Nguyen Dang, and Ian Miguel Frugal Algorithm Selection (Short Paper) 10.4230/LIPIcs.CP.2024.38
• Filipe Souza, Diarmuid Grimes, and Barry O'Sullivan An Investigation of Generic Approaches to Large Neighbourhood Search (Short Paper) 10.4230/LIPIcs.CP.2024.39
• Neng-Fa Zhou Encoding the Hamiltonian Cycle Problem into SAT Based on Vertex Elimination (Short Paper) 10.4230/LIPIcs.CP.2024.40