default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID30th CP 2024: Girona, Spain
- Paul Shaw
:
30th International Conference on Principles and Practice of Constraint Programming, CP 2024, September 2-6, 2024, Girona, Spain. LIPIcs 307, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-336-2 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xxii
- Ian P. Gent:
Solving Patience and Solitaire Games with Good Old Fashioned AI (Invited Talk). 1:1-1:1 - Francesca Rossi:
Thinking Fast and Slow in AI: A Cognitive Architecture to Augment Both AI and Human Reasoning (Invited Talk). 2:1-2:1 - Markus Anders, Sofia Brenner, Gaurav Rattan:
The Complexity of Symmetry Breaking Beyond Lex-Leader. 3:1-3:24 - Jeremias Berg, Bart Bogaerts, Jakob Nordström, Andy Oertel, Tobias Paxian, Dieter Vandesande:
Certifying Without Loss of Generality Reasoning in Solution-Improving Maximum Satisfiability. 4:1-4:28 - Zhihan Chen, Peng Lin, Hao Hu, Shaowei Cai:
ParLS-PBO: A Parallel Local Search Solver for Pseudo Boolean Optimization. 5:1-5:17 - Xiamin Chen, Zhendong Lei, Pinyan Lu:
Deep Cooperation of Local Search and Unit Propagation Techniques. 6:1-6:16 - Samuel Cloutier, Claude-Guy Quimper:
Cumulative Scheduling with Calendars and Overtime. 7:1-7:16 - João Cortes, Inês Lynce, Vasco M. Manquinho:
Slide&Drill, a New Approach for Multi-Objective Combinatorial Optimization. 8:1-8:17 - Emir Demirovic, Ciaran McCreesh, Matthew J. McIlree, Jakob Nordström, Andy Oertel, Konstantin Sidorov:
Pseudo-Boolean Reasoning About States and Transitions to Certify Dynamic Programming and Decision Diagram Algorithms. 9:1-9:21 - Alexandre Dubray, Pierre Schaus, Siegfried Nijssen:
Anytime Weighted Model Counting with Approximation Guarantees for Probabilistic Inference. 10:1-10:16 - Maarten Flippo, Konstantin Sidorov, Imko Marijnissen, Jeff Smits, Emir Demirovic:
A Multi-Stage Proof Logging Framework to Certify the Correctness of CP Solvers. 11:1-11:20 - Adam Francis Green, J. Christopher Beck, Amanda Jane Coles:
Using Constraint Programming for Disjunctive Scheduling in Temporal AI Planning. 12:1-12:17 - Cunjing Ge, Armin Biere:
Improved Bounds of Integer Solution Counts via Volume and Extending to Mixed-Integer Linear Constraints. 13:1-13:17 - Panteleimon Iosif, Nikolaos Ploskas, Kostas Stergiou, Dimosthenis C. Tsouros:
A CP/LS Heuristic Method for Maxmin and Minmax Location Problems with Distance Constraints. 14:1-14:21 - Peter Jonsson, Victor Lagerkvist, George Osipov:
CSPs with Few Alien Constraints. 15:1-15:17 - Jihye Jung, Kevin Dalmeijer, Pascal Van Hentenryck:
A New Optimization Model for Multiple-Control Toffoli Quantum Circuit Design. 16:1-16:20 - Artem Kaznatcheev, Melle van Marle:
Exponential Steepest Ascent from Valued Constraint Graphs of Pathwidth Four. 17:1-17:16 - Duc Anh Le, Stéphanie Roussel, Christophe Lecoutre, Anouck Chan:
Learning Effect and Compound Activities in High Multiplicity RCPSP: Application to Satellite Production. 18:1-18:25 - Peng Lin, Mengchuan Zou, Shaowei Cai:
An Efficient Local Search Solver for Mixed Integer Programming. 19:1-19:19 - Kostis Michailidis, Dimos Tsouros, Tias Guns:
Constraint Modelling with LLMs Using In-Context Learning. 20:1-20:27 - Mohsen Nafar, Michael Römer:
Strengthening Relaxed Decision Diagrams for Maximum Independent Set Problem: Novel Variable Ordering and Merge Heuristics. 21:1-21:17 - Augustin Parjadis, Quentin Cappart, Bistra Dilkina, Aaron M. Ferber, Louis-Martin Rousseau:
Learning Lagrangian Multipliers for the Travelling Salesman Problem. 22:1-22:18 - Xavier Pucel, Stéphanie Roussel:
Constraint Programming Model for Assembly Line Balancing and Scheduling with Walking Workers and Parallel Stations. 23:1-23:21 - Ben Rachmut, Roie Zivan, William Yeoh:
Latency-Aware 2-Opt Monotonic Local Search for Distributed Constraint Optimization. 24:1-24:17 - Florian Régin, Elisabetta De Maria, Alexandre Bonlarron:
Combining Constraint Programming Reasoning with Large Language Model Predictions. 25:1-25:18 - André Schidler, Stefan Szeider:
Structure-Guided Local Improvement for Maximum Satisfiability. 26:1-26:23 - Margaux Schmied, Jean-Charles Régin:
Efficient Implementation of the Global Cardinality Constraint with Costs. 27:1-27:18 - Fabio Tardivo, Laurent Michel, Enrico Pontelli:
CP for Bin Packing with Multi-Core and GPUs. 28:1-28:19 - Wout Vanroose, Ignace Bleukx, Jo Devriendt, Dimos Tsouros, Hélène Verhaeghe, Tias Guns:
Mutational Fuzz Testing for Constraint Modeling Systems. 29:1-29:25 - Hélène Verhaeghe, Quentin Cappart, Gilles Pesant, Claude-Guy Quimper:
Learning Precedences for Scheduling Problems with Graph Neural Networks. 30:1-30:18 - Oleg Zaikin:
Inverting Step-Reduced SHA-1 and MD5 by Parameterized SAT Solvers. 31:1-31:19 - Jiachen Zhang, J. Christopher Beck:
Solving LBBD Master Problems with Constraint Programming and Domain-Independent Dynamic Programming. 32:1-32:21 - Roie Zivan, Shiraz Regev, William Yeoh:
Ex-Ante Constraint Elicitation in Incomplete DCOPs. 33:1-33:16 - Sami Cherif, Heythem Sattoutah, Chu-Min Li, Corinne Lucet, Laure Brisoux Devendeville:
Minimizing Working-Group Conflicts in Conference Session Scheduling Through Maximum Satisfiability (Short Paper). 34:1-34:11 - Jorke M. de Vlas:
On the Complexity of Integer Programming with Fixed-Coefficient Scaling (Short Paper). 35:1-35:9 - Augustin Delecluse, Pierre Schaus:
Black-Box Value Heuristics for Solving Optimization Problems with Constraint Programming (Short Paper). 36:1-36:12 - Markus Kirchweger, Stefan Szeider:
Computing Small Rainbow Cycle Numbers with SAT Modulo Symmetries (Short Paper). 37:1-37:11 - Erdem Kus, Özgür Akgün, Nguyen Dang, Ian Miguel:
Frugal Algorithm Selection (Short Paper). 38:1-38:16 - Filipe Souza, Diarmuid Grimes, Barry O'Sullivan:
An Investigation of Generic Approaches to Large Neighbourhood Search (Short Paper). 39:1-39:10 - Neng-Fa Zhou:
Encoding the Hamiltonian Cycle Problem into SAT Based on Vertex Elimination (Short Paper). 40:1-40:8
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-09-17 00:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
