@Proceedings{shaw:LIPIcs.CP.2024,
title = {{LIPIcs, Volume 307, CP 2024, Complete Volume}},
booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
pages = {1--728},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-336-2},
ISSN = {1868-8969},
year = {2024},
volume = {307},
editor = {Shaw, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024},
URN = {urn:nbn:de:0030-drops-206842},
doi = {10.4230/LIPIcs.CP.2024},
annote = {Keywords: LIPIcs, Volume 307, CP 2024, Complete Volume}
}
@InProceedings{shaw:LIPIcs.CP.2024.0,
author = {Shaw, Paul},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
pages = {0:i--0:xxii},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-336-2},
ISSN = {1868-8969},
year = {2024},
volume = {307},
editor = {Shaw, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.0},
URN = {urn:nbn:de:0030-drops-206854},
doi = {10.4230/LIPIcs.CP.2024.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{gent:LIPIcs.CP.2024.1,
author = {Gent, Ian P.},
title = {{Solving Patience and Solitaire Games with Good Old Fashioned AI}},
booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
pages = {1:1--1:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-336-2},
ISSN = {1868-8969},
year = {2024},
volume = {307},
editor = {Shaw, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.1},
URN = {urn:nbn:de:0030-drops-206863},
doi = {10.4230/LIPIcs.CP.2024.1},
annote = {Keywords: AI Search, Solitaire and Patience Games}
}
@InProceedings{rossi:LIPIcs.CP.2024.2,
author = {Rossi, Francesca},
title = {{Thinking Fast and Slow in AI: A Cognitive Architecture to Augment Both AI and Human Reasoning}},
booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
pages = {2:1--2:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-336-2},
ISSN = {1868-8969},
year = {2024},
volume = {307},
editor = {Shaw, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.2},
URN = {urn:nbn:de:0030-drops-206874},
doi = {10.4230/LIPIcs.CP.2024.2},
annote = {Keywords: Artificial Intelligence, Meta-reasoning}
}
@InProceedings{anders_et_al:LIPIcs.CP.2024.3,
author = {Anders, Markus and Brenner, Sofia and Rattan, Gaurav},
title = {{The Complexity of Symmetry Breaking Beyond Lex-Leader}},
booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
pages = {3:1--3:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-336-2},
ISSN = {1868-8969},
year = {2024},
volume = {307},
editor = {Shaw, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.3},
URN = {urn:nbn:de:0030-drops-206881},
doi = {10.4230/LIPIcs.CP.2024.3},
annote = {Keywords: symmetry breaking, boolean satisfiability, matrix models, graph isomorphism}
}
@InProceedings{berg_et_al:LIPIcs.CP.2024.4,
author = {Berg, Jeremias and Bogaerts, Bart and Nordstr\"{o}m, Jakob and Oertel, Andy and Paxian, Tobias and Vandesande, Dieter},
title = {{Certifying Without Loss of Generality Reasoning in Solution-Improving Maximum Satisfiability}},
booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
pages = {4:1--4:28},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-336-2},
ISSN = {1868-8969},
year = {2024},
volume = {307},
editor = {Shaw, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.4},
URN = {urn:nbn:de:0030-drops-206895},
doi = {10.4230/LIPIcs.CP.2024.4},
annote = {Keywords: proof logging, certifying algorithms, MaxSAT, solution-improving search, SAT-UNSAT, maximum satisfiability, combinatorial optimization, certification, pseudo-Boolean}
}
@InProceedings{chen_et_al:LIPIcs.CP.2024.5,
author = {Chen, Zhihan and Lin, Peng and Hu, Hao and Cai, Shaowei},
title = {{ParLS-PBO: A Parallel Local Search Solver for Pseudo Boolean Optimization}},
booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
pages = {5:1--5:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-336-2},
ISSN = {1868-8969},
year = {2024},
volume = {307},
editor = {Shaw, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.5},
URN = {urn:nbn:de:0030-drops-206900},
doi = {10.4230/LIPIcs.CP.2024.5},
annote = {Keywords: Pseudo-Boolean Optimization, Parallel Solving, Local Search, Scoring Function, Solution Pool}
}
@InProceedings{chen_et_al:LIPIcs.CP.2024.6,
author = {Chen, Xiamin and Lei, Zhendong and Lu, Pinyan},
title = {{Deep Cooperation of Local Search and Unit Propagation Techniques}},
booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
pages = {6:1--6:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-336-2},
ISSN = {1868-8969},
year = {2024},
volume = {307},
editor = {Shaw, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.6},
URN = {urn:nbn:de:0030-drops-206918},
doi = {10.4230/LIPIcs.CP.2024.6},
annote = {Keywords: PBO, Partial MaxSAT, LS, CDCL}
}
@InProceedings{cloutier_et_al:LIPIcs.CP.2024.7,
author = {Cloutier, Samuel and Quimper, Claude-Guy},
title = {{Cumulative Scheduling with Calendars and Overtime}},
booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
pages = {7:1--7:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-336-2},
ISSN = {1868-8969},
year = {2024},
volume = {307},
editor = {Shaw, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.7},
URN = {urn:nbn:de:0030-drops-206927},
doi = {10.4230/LIPIcs.CP.2024.7},
annote = {Keywords: Constraint programming, Scheduling, Global constraints, Calendars, Overtime, Cumulative constraint, Time-Tabling}
}
@InProceedings{cortes_et_al:LIPIcs.CP.2024.8,
author = {Cortes, Jo\~{a}o and Lynce, In\^{e}s and Manquinho, Vasco},
title = {{Slide\&Drill, a New Approach for Multi-Objective Combinatorial Optimization}},
booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
pages = {8:1--8:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-336-2},
ISSN = {1868-8969},
year = {2024},
volume = {307},
editor = {Shaw, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.8},
URN = {urn:nbn:de:0030-drops-206932},
doi = {10.4230/LIPIcs.CP.2024.8},
annote = {Keywords: Multi-Objective Combinatorial Optimization, Satisfiability Algorithms}
}
@InProceedings{demirovic_et_al:LIPIcs.CP.2024.9,
author = {Demirovi\'{c}, Emir and McCreesh, Ciaran and McIlree, Matthew J. and Nordstr\"{o}m, Jakob and Oertel, Andy and Sidorov, Konstantin},
title = {{Pseudo-Boolean Reasoning About States and Transitions to Certify Dynamic Programming and Decision Diagram Algorithms}},
booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
pages = {9:1--9:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-336-2},
ISSN = {1868-8969},
year = {2024},
volume = {307},
editor = {Shaw, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.9},
URN = {urn:nbn:de:0030-drops-206948},
doi = {10.4230/LIPIcs.CP.2024.9},
annote = {Keywords: Proof logging, dynamic programming, decision diagrams}
}
@InProceedings{dubray_et_al:LIPIcs.CP.2024.10,
author = {Dubray, Alexandre and Schaus, Pierre and Nijssen, Siegfried},
title = {{Anytime Weighted Model Counting with Approximation Guarantees for Probabilistic Inference}},
booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
pages = {10:1--10:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-336-2},
ISSN = {1868-8969},
year = {2024},
volume = {307},
editor = {Shaw, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.10},
URN = {urn:nbn:de:0030-drops-206956},
doi = {10.4230/LIPIcs.CP.2024.10},
annote = {Keywords: Projected Weighted Model Counting, Limited Discrepancy Search, Approximate Method, Probabilistic Inference}
}
@InProceedings{flippo_et_al:LIPIcs.CP.2024.11,
author = {Flippo, Maarten and Sidorov, Konstantin and Marijnissen, Imko and Smits, Jeff and Demirovi\'{c}, Emir},
title = {{A Multi-Stage Proof Logging Framework to Certify the Correctness of CP Solvers}},
booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
pages = {11:1--11:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-336-2},
ISSN = {1868-8969},
year = {2024},
volume = {307},
editor = {Shaw, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.11},
URN = {urn:nbn:de:0030-drops-206969},
doi = {10.4230/LIPIcs.CP.2024.11},
annote = {Keywords: proof logging, formal verification, constraint programming}
}
@InProceedings{francisgreen_et_al:LIPIcs.CP.2024.12,
author = {Francis Green, Adam and Beck, J. Christopher and Coles, Amanda},
title = {{Using Constraint Programming for Disjunctive Scheduling in Temporal AI Planning}},
booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
pages = {12:1--12:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-336-2},
ISSN = {1868-8969},
year = {2024},
volume = {307},
editor = {Shaw, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.12},
URN = {urn:nbn:de:0030-drops-206974},
doi = {10.4230/LIPIcs.CP.2024.12},
annote = {Keywords: AI Planning, Temporal-Numeric Planning, Constraint Programming, Scheduling}
}
@InProceedings{ge_et_al:LIPIcs.CP.2024.13,
author = {Ge, Cunjing and Biere, Armin},
title = {{Improved Bounds of Integer Solution Counts via Volume and Extending to Mixed-Integer Linear Constraints}},
booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
pages = {13:1--13:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-336-2},
ISSN = {1868-8969},
year = {2024},
volume = {307},
editor = {Shaw, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.13},
URN = {urn:nbn:de:0030-drops-206983},
doi = {10.4230/LIPIcs.CP.2024.13},
annote = {Keywords: Integer Solution Counting, Mixed-Integer Linear Constraints, #SMT(LA) Problems, Volume of Polytopes}
}
@InProceedings{iosif_et_al:LIPIcs.CP.2024.14,
author = {Iosif, Panteleimon and Ploskas, Nikolaos and Stergiou, Kostas and Tsouros, Dimosthenis C.},
title = {{A CP/LS Heuristic Method for Maxmin and Minmax Location Problems with Distance Constraints}},
booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
pages = {14:1--14:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-336-2},
ISSN = {1868-8969},
year = {2024},
volume = {307},
editor = {Shaw, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.14},
URN = {urn:nbn:de:0030-drops-206995},
doi = {10.4230/LIPIcs.CP.2024.14},
annote = {Keywords: Constraint Programming, Local Search, facility location, distance constraints, optimization}
}
@InProceedings{jonsson_et_al:LIPIcs.CP.2024.15,
author = {Jonsson, Peter and Lagerkvist, Victor and Osipov, George},
title = {{CSPs with Few Alien Constraints}},
booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
pages = {15:1--15:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-336-2},
ISSN = {1868-8969},
year = {2024},
volume = {307},
editor = {Shaw, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.15},
URN = {urn:nbn:de:0030-drops-207005},
doi = {10.4230/LIPIcs.CP.2024.15},
annote = {Keywords: Constraint satisfaction, parameterized complexity, hybrid theories}
}
@InProceedings{jung_et_al:LIPIcs.CP.2024.16,
author = {Jung, Jihye and Dalmeijer, Kevin and Van Hentenryck, Pascal},
title = {{A New Optimization Model for Multiple-Control Toffoli Quantum Circuit Design}},
booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
pages = {16:1--16:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-336-2},
ISSN = {1868-8969},
year = {2024},
volume = {307},
editor = {Shaw, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.16},
URN = {urn:nbn:de:0030-drops-207010},
doi = {10.4230/LIPIcs.CP.2024.16},
annote = {Keywords: Constraint Programming, Quantum Circuit Design, Reversible Circuits}
}
@InProceedings{kaznatcheev_et_al:LIPIcs.CP.2024.17,
author = {Kaznatcheev, Artem and van Marle, Melle},
title = {{Exponential Steepest Ascent from Valued Constraint Graphs of Pathwidth Four}},
booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
pages = {17:1--17:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-336-2},
ISSN = {1868-8969},
year = {2024},
volume = {307},
editor = {Shaw, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.17},
URN = {urn:nbn:de:0030-drops-207021},
doi = {10.4230/LIPIcs.CP.2024.17},
annote = {Keywords: valued constraint satisfaction problem, steepest ascent, local search, bounded treewidth, intractability}
}
@InProceedings{le_et_al:LIPIcs.CP.2024.18,
author = {Le, Duc Anh and Roussel, St\'{e}phanie and Lecoutre, Christophe and Chan, Anouck},
title = {{Learning Effect and Compound Activities in High Multiplicity RCPSP: Application to Satellite Production}},
booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
pages = {18:1--18:25},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-336-2},
ISSN = {1868-8969},
year = {2024},
volume = {307},
editor = {Shaw, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.18},
URN = {urn:nbn:de:0030-drops-207037},
doi = {10.4230/LIPIcs.CP.2024.18},
annote = {Keywords: High-multiplicity Project Scheduling, Learning Effect, Compound Activities, Satellite Assembly Line, Constraint Programming, Symmetry Breaking}
}
@InProceedings{lin_et_al:LIPIcs.CP.2024.19,
author = {Lin, Peng and Zou, Mengchuan and Cai, Shaowei},
title = {{An Efficient Local Search Solver for Mixed Integer Programming}},
booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
pages = {19:1--19:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-336-2},
ISSN = {1868-8969},
year = {2024},
volume = {307},
editor = {Shaw, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.19},
URN = {urn:nbn:de:0030-drops-207041},
doi = {10.4230/LIPIcs.CP.2024.19},
annote = {Keywords: Mixed Integer Programming, Local Search, Operator, Scoring Function}
}
@InProceedings{michailidis_et_al:LIPIcs.CP.2024.20,
author = {Michailidis, Kostis and Tsouros, Dimos and Guns, Tias},
title = {{Constraint Modelling with LLMs Using In-Context Learning}},
booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
pages = {20:1--20:27},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-336-2},
ISSN = {1868-8969},
year = {2024},
volume = {307},
editor = {Shaw, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.20},
URN = {urn:nbn:de:0030-drops-207053},
doi = {10.4230/LIPIcs.CP.2024.20},
annote = {Keywords: Constraint Modelling, Constraint Acquisition, Constraint Programming, Large Language Models, In-Context Learning, Natural Language Processing, Named Entity Recognition, Retrieval-Augmented Generation, Optimisation}
}
@InProceedings{nafar_et_al:LIPIcs.CP.2024.21,
author = {Nafar, Mohsen and R\"{o}mer, Michael},
title = {{Strengthening Relaxed Decision Diagrams for Maximum Independent Set Problem: Novel Variable Ordering and Merge Heuristics}},
booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
pages = {21:1--21:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-336-2},
ISSN = {1868-8969},
year = {2024},
volume = {307},
editor = {Shaw, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.21},
URN = {urn:nbn:de:0030-drops-207069},
doi = {10.4230/LIPIcs.CP.2024.21},
annote = {Keywords: Decision Diagram, Dynamic Programming, Maximum Independent Set Problem, Dual Bound}
}
@InProceedings{parjadis_et_al:LIPIcs.CP.2024.22,
author = {Parjadis, Augustin and Cappart, Quentin and Dilkina, Bistra and Ferber, Aaron and Rousseau, Louis-Martin},
title = {{Learning Lagrangian Multipliers for the Travelling Salesman Problem}},
booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
pages = {22:1--22:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-336-2},
ISSN = {1868-8969},
year = {2024},
volume = {307},
editor = {Shaw, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.22},
URN = {urn:nbn:de:0030-drops-207076},
doi = {10.4230/LIPIcs.CP.2024.22},
annote = {Keywords: Lagrangian relaxation, unsupervised learning, graph neural network}
}
@InProceedings{pucel_et_al:LIPIcs.CP.2024.23,
author = {Pucel, Xavier and Roussel, St\'{e}phanie},
title = {{Constraint Programming Model for Assembly Line Balancing and Scheduling with Walking Workers and Parallel Stations}},
booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
pages = {23:1--23:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-336-2},
ISSN = {1868-8969},
year = {2024},
volume = {307},
editor = {Shaw, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.23},
URN = {urn:nbn:de:0030-drops-207087},
doi = {10.4230/LIPIcs.CP.2024.23},
annote = {Keywords: Constraint Programming, Assembly Line, Balancing and Scheduling, Parallel Workstations, Walking Workers}
}
@InProceedings{rachmut_et_al:LIPIcs.CP.2024.24,
author = {Rachmut, Ben and Zivan, Roie and Yeoh, William},
title = {{Latency-Aware 2-Opt Monotonic Local Search for Distributed Constraint Optimization}},
booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
pages = {24:1--24:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-336-2},
ISSN = {1868-8969},
year = {2024},
volume = {307},
editor = {Shaw, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.24},
URN = {urn:nbn:de:0030-drops-207096},
doi = {10.4230/LIPIcs.CP.2024.24},
annote = {Keywords: Distributed Constraint Optimization Problems, Distributed Local Search Algorithms, Latency Awareness, Multi-Agent Optimization}
}
@InProceedings{regin_et_al:LIPIcs.CP.2024.25,
author = {R\'{e}gin, Florian and De Maria, Elisabetta and Bonlarron, Alexandre},
title = {{Combining Constraint Programming Reasoning with Large Language Model Predictions}},
booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
pages = {25:1--25:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-336-2},
ISSN = {1868-8969},
year = {2024},
volume = {307},
editor = {Shaw, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.25},
URN = {urn:nbn:de:0030-drops-207109},
doi = {10.4230/LIPIcs.CP.2024.25},
annote = {Keywords: Solver and Tools, ML-augmented CP, Constrained Text Generation, ML alongside CO}
}
@InProceedings{schidler_et_al:LIPIcs.CP.2024.26,
author = {Schidler, Andr\'{e} and Szeider, Stefan},
title = {{Structure-Guided Local Improvement for Maximum Satisfiability}},
booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
pages = {26:1--26:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-336-2},
ISSN = {1868-8969},
year = {2024},
volume = {307},
editor = {Shaw, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.26},
URN = {urn:nbn:de:0030-drops-207112},
doi = {10.4230/LIPIcs.CP.2024.26},
annote = {Keywords: maximum satisfiability, large neighborhood search (LNS), SAT-based local improvement (SLIM), incomplete MaxSAT, graphical structure, metaheuristic}
}
@InProceedings{schmied_et_al:LIPIcs.CP.2024.27,
author = {Schmied, Margaux and R\'{e}gin, Jean-Charles},
title = {{Efficient Implementation of the Global Cardinality Constraint with Costs}},
booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
pages = {27:1--27:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-336-2},
ISSN = {1868-8969},
year = {2024},
volume = {307},
editor = {Shaw, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.27},
URN = {urn:nbn:de:0030-drops-207126},
doi = {10.4230/LIPIcs.CP.2024.27},
annote = {Keywords: global constraint, filtering algorithm, cardinality constraints with costs, arc consistency}
}
@InProceedings{tardivo_et_al:LIPIcs.CP.2024.28,
author = {Tardivo, Fabio and Michel, Laurent and Pontelli, Enrico},
title = {{CP for Bin Packing with Multi-Core and GPUs}},
booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
pages = {28:1--28:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-336-2},
ISSN = {1868-8969},
year = {2024},
volume = {307},
editor = {Shaw, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.28},
URN = {urn:nbn:de:0030-drops-207138},
doi = {10.4230/LIPIcs.CP.2024.28},
annote = {Keywords: Constraint Propagation, Bin Packing, Parallelism, GPU, Lower Bounds}
}
@InProceedings{vanroose_et_al:LIPIcs.CP.2024.29,
author = {Vanroose, Wout and Bleukx, Ignace and Devriendt, Jo and Tsouros, Dimos and Verhaeghe, H\'{e}l\`{e}ne and Guns, Tias},
title = {{Mutational Fuzz Testing for Constraint Modeling Systems}},
booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
pages = {29:1--29:25},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-336-2},
ISSN = {1868-8969},
year = {2024},
volume = {307},
editor = {Shaw, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.29},
URN = {urn:nbn:de:0030-drops-207149},
doi = {10.4230/LIPIcs.CP.2024.29},
annote = {Keywords: fuzz testing, Constraint modeling language, bugs, mutational testing, modeling, constraint reformulation}
}
@InProceedings{verhaeghe_et_al:LIPIcs.CP.2024.30,
author = {Verhaeghe, H\'{e}l\`{e}ne and Cappart, Quentin and Pesant, Gilles and Quimper, Claude-Guy},
title = {{Learning Precedences for Scheduling Problems with Graph Neural Networks}},
booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
pages = {30:1--30:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-336-2},
ISSN = {1868-8969},
year = {2024},
volume = {307},
editor = {Shaw, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.30},
URN = {urn:nbn:de:0030-drops-207150},
doi = {10.4230/LIPIcs.CP.2024.30},
annote = {Keywords: Scheduling, Precedence graph, Graph neural network}
}
@InProceedings{zaikin:LIPIcs.CP.2024.31,
author = {Zaikin, Oleg},
title = {{Inverting Step-Reduced SHA-1 and MD5 by Parameterized SAT Solvers}},
booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
pages = {31:1--31:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-336-2},
ISSN = {1868-8969},
year = {2024},
volume = {307},
editor = {Shaw, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.31},
URN = {urn:nbn:de:0030-drops-207165},
doi = {10.4230/LIPIcs.CP.2024.31},
annote = {Keywords: cryptographic hash function, MD5, SHA-1, preimage attack, SAT, Cube-and-Conquer}
}
@InProceedings{zhang_et_al:LIPIcs.CP.2024.32,
author = {Zhang, Jiachen and Beck, J. Christopher},
title = {{Solving LBBD Master Problems with Constraint Programming and Domain-Independent Dynamic Programming}},
booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
pages = {32:1--32:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-336-2},
ISSN = {1868-8969},
year = {2024},
volume = {307},
editor = {Shaw, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.32},
URN = {urn:nbn:de:0030-drops-207171},
doi = {10.4230/LIPIcs.CP.2024.32},
annote = {Keywords: constraint programming, domain-independent dynamic programming, logic-based Benders decomposition, assembly line balancing, sequence-dependent setup}
}
@InProceedings{zivan_et_al:LIPIcs.CP.2024.33,
author = {Zivan, Roie and Regev, Shiraz and Yeoh, William},
title = {{Ex-Ante Constraint Elicitation in Incomplete DCOPs}},
booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
pages = {33:1--33:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-336-2},
ISSN = {1868-8969},
year = {2024},
volume = {307},
editor = {Shaw, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.33},
URN = {urn:nbn:de:0030-drops-207182},
doi = {10.4230/LIPIcs.CP.2024.33},
annote = {Keywords: Distributed Constraint Optimization Problems, Preference Elicitation, Multi-Agent Optimization}
}
@InProceedings{cherif_et_al:LIPIcs.CP.2024.34,
author = {Cherif, Sami and Sattoutah, Heythem and Li, Chu-Min and Lucet, Corinne and Brisoux-Devendeville, Laure},
title = {{Minimizing Working-Group Conflicts in Conference Session Scheduling Through Maximum Satisfiability}},
booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
pages = {34:1--34:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-336-2},
ISSN = {1868-8969},
year = {2024},
volume = {307},
editor = {Shaw, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.34},
URN = {urn:nbn:de:0030-drops-207190},
doi = {10.4230/LIPIcs.CP.2024.34},
annote = {Keywords: Maximum Satisfiability, Scheduling, Modeling}
}
@InProceedings{devlas:LIPIcs.CP.2024.35,
author = {de Vlas, Jorke M.},
title = {{On the Complexity of Integer Programming with Fixed-Coefficient Scaling}},
booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
pages = {35:1--35:9},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-336-2},
ISSN = {1868-8969},
year = {2024},
volume = {307},
editor = {Shaw, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.35},
URN = {urn:nbn:de:0030-drops-207203},
doi = {10.4230/LIPIcs.CP.2024.35},
annote = {Keywords: constraint satisfaction problems, integer programming, CSP dichotomy}
}
@InProceedings{delecluse_et_al:LIPIcs.CP.2024.36,
author = {Delecluse, Augustin and Schaus, Pierre},
title = {{Black-Box Value Heuristics for Solving Optimization Problems with Constraint Programming}},
booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
pages = {36:1--36:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-336-2},
ISSN = {1868-8969},
year = {2024},
volume = {307},
editor = {Shaw, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.36},
URN = {urn:nbn:de:0030-drops-207214},
doi = {10.4230/LIPIcs.CP.2024.36},
annote = {Keywords: Constraint Programming, Value Selection, Look-Ahead, Optimization}
}
@InProceedings{kirchweger_et_al:LIPIcs.CP.2024.37,
author = {Kirchweger, Markus and Szeider, Stefan},
title = {{Computing Small Rainbow Cycle Numbers with SAT Modulo Symmetries}},
booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
pages = {37:1--37:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-336-2},
ISSN = {1868-8969},
year = {2024},
volume = {307},
editor = {Shaw, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.37},
URN = {urn:nbn:de:0030-drops-207221},
doi = {10.4230/LIPIcs.CP.2024.37},
annote = {Keywords: EFX, rainbow cycle number, SAT modulo Symmetries, combinatorial search}
}
@InProceedings{kus_et_al:LIPIcs.CP.2024.38,
author = {Ku\c{s}, Erdem and Akg\"{u}n, \"{O}zg\"{u}r and Dang, Nguyen and Miguel, Ian},
title = {{Frugal Algorithm Selection}},
booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
pages = {38:1--38:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-336-2},
ISSN = {1868-8969},
year = {2024},
volume = {307},
editor = {Shaw, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.38},
URN = {urn:nbn:de:0030-drops-207239},
doi = {10.4230/LIPIcs.CP.2024.38},
annote = {Keywords: Algorithm Selection, Active Learning}
}
@InProceedings{souza_et_al:LIPIcs.CP.2024.39,
author = {Souza, Filipe and Grimes, Diarmuid and O'Sullivan, Barry},
title = {{An Investigation of Generic Approaches to Large Neighbourhood Search}},
booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
pages = {39:1--39:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-336-2},
ISSN = {1868-8969},
year = {2024},
volume = {307},
editor = {Shaw, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.39},
URN = {urn:nbn:de:0030-drops-207248},
doi = {10.4230/LIPIcs.CP.2024.39},
annote = {Keywords: Combinatorial Optimization, Metaheuristics, Large Neighborhood Search (LNS), Machine Reassignment Problem, Car Sequencing Problem, Steel Mill Slab Problem}
}
@InProceedings{zhou:LIPIcs.CP.2024.40,
author = {Zhou, Neng-Fa},
title = {{Encoding the Hamiltonian Cycle Problem into SAT Based on Vertex Elimination}},
booktitle = {30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
pages = {40:1--40:8},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-336-2},
ISSN = {1868-8969},
year = {2024},
volume = {307},
editor = {Shaw, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.40},
URN = {urn:nbn:de:0030-drops-207258},
doi = {10.4230/LIPIcs.CP.2024.40},
annote = {Keywords: Graph constraints, the Hamiltonian cycle problem, SAT encoding, Vertex elimination, Graph synthesis}
}
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