


default search action
31st CP 2025: Glasgow, UK
- Maria Garcia de la Banda

:
31st International Conference on Principles and Practice of Constraint Programming, CP 2025, Glasgow, Scotland, August 10-15, 2025. LIPIcs 340, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2025, ISBN 978-3-95977-380-5 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xxii

- Ruzica Piskac:

Privacy-Preserving SAT Solving (Invited Talk). 1:1-1:2 - Christine Solnon:

Anytime and Exact Search for Planning Problems: How to explore a DP-based state transition graph with A*, CP and LS? (Invited Talk). 2:1-2:2 - Valentin Antuori, Damien T. Wojtowicz, Emmanuel Hebrard:

Solving the Agile Earth Observation Satellite Scheduling Problem with CP and Local Search. 3:1-3:22 - Robbin Baauw, Maarten Flippo, Emir Demirovic:

Conflict Analysis Based on Cutting-Planes for Constraint Programming. 4:1-4:19 - J. Christopher Beck, Ryo Kuroiwa

, Jimmy H. M. Lee, Peter J. Stuckey, Allen Z. Zhong
:
Transition Dominance in Domain-Independent Dynamic Programming. 5:1-5:23 - Ignace Bleukx, Ryma Boumazouza, Tias Guns

, Nadine Laage, Guillaume Povéda:
Modeling and Explaining an Industrial Workforce Allocation and Scheduling Problem. 6:1-6:24 - Manuel Chastenay, Xavier Zwingmann, Claude-Guy Quimper, Jonathan Gaudreault:

Optimizing 2D Cutting: A Bin Packing Approach to Minimize Scraps and Maximize Their Reusability. 7:1-7:21 - Michael Codish, Mikolás Janota:

Breaking Symmetries with Involutions. 8:1-8:17 - Nguyen Dang

, Ian P. Gent, Peter Nightingale, Felix Ulrich-Oltean, Jack Waller
:
Constraint Models for Klondike. 9:1-9:20 - Jip J. Dekker

, Jason Nguyen, Peter J. Stuckey, Guido Tack:
Unit Types for MiniZinc. 10:1-10:20 - Yousra El Ghazi, Djamal Habet, Cyril Terrioux:

Cargo Routing Optimization in Liner Shipping Networks. 11:1-11:18 - Michael Hartisch, Leroy Chew

:
An Expansion-Based Approach for Quantified Integer Programming. 12:1-12:26 - Emmanuel Hebrard:

Disjunctive Scheduling in Tempo. 13:1-13:22 - Clemens Hofstadler, Daniela Kaufmann:

Guess and Prove: A Hybrid Approach to Linear Polynomial Recovery in Circuit Verification. 14:1-14:22 - Hannes Ihalainen, Jeremias Berg

, Matti Järvisalo, Bart Bogaerts
:
Symmetric Core Learning for Pseudo-Boolean Optimization by Implicit Hitting Sets. 15:1-15:26 - Jef Jacobs

, Wolfgang De Meuter
, Jens Nicolay:
PrintTalk: A Language for Constraint-Based 3D Modelling. 16:1-16:22 - Mohimenul Kabir, Van-Giang Trinh, Samuel Pastva

, Kuldeep S. Meel:
Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks. 17:1-17:26 - Artem Kaznatcheev, Sofia Vazquez Alferez:

Greed Is Slow on Sparse Graphs of Oriented Valued Constraints. 18:1-18:13 - Asma Khoualdia, Sami Cherif, Stéphane Devismes, Léo Robert:

Analyzing Self-Stabilization of Synchronous Unison via Propositional Satisfiability. 19:1-19:21 - Frej Knutar Lewander

, Pierre Flener, Justin Pearson:
Dependency-Curated Large Neighbourhood Search. 20:1-20:17 - Wietze Koops

, Daniel Le Berre, Magnus O. Myreen, Jakob Nordström, Andy Oertel
, Yong Kiam Tan, Marc Vinyals:
Practically Feasible Proof Logging for Pseudo-Boolean Optimization. 21:1-21:27 - Buddhi W. Kothalawala

, Henning Koehler, Qing Wang:
Learning to Bound for Maximum Common Subgraph Algorithms. 22:1-22:18 - Ryo Kuroiwa

, J. Christopher Beck:
RPID: Rust Programmable Interface for Domain-Independent Dynamic Programming. 23:1-23:21 - Mikael Z. Lagerkvist, Magnus Rattfeldt:

The Work Task Variation Problem. 24:1-24:23 - Duc Anh Le, Stéphanie Roussel, Christophe Lecoutre:

Aircraft Resource-Constrained Assembly Line Balancing with Learning Effect: A Constraint Programming Approach. 25:1-25:24 - Peng Lin

, Shaowei Cai, Mengchuan Zou, Shengqi Chen
:
Parallel MIP Solving with Dynamic Task Decomposition. 26:1-26:19 - Tim Luchterhand

, Emmanuel Hebrard, Sylvie Thiébaux:
Understanding the Impact of Value Selection Heuristics in Scheduling Problems. 27:1-27:23 - Ole Lübke

, Jeremias Berg
:
SLS-Enhanced Core-Boosted Linear Search for Anytime Maximum Satisfiability. 28:1-28:20 - Younes Mechqrane, Ismail Elabbassi:

From Prediction to Action: A Constraint-Based Approach to Predictive Policing. 29:1-29:18 - Daniel Pekar, J. Christopher Beck:

Exact Methods for the Travelling Salesperson Problem with Self-Deleting Graphs. 30:1-30:19 - Alessio Pellegrino

, Özgür Akgün
, Nguyen Dang
, Zeynep Kiziltan, Ian Miguel
:
Transformer-Based Feature Learning for Algorithm Selection in Combinatorial Optimisation. 31:1-31:22 - Xiao Peng, Christine Solnon:

BFS-Based Canonical Codes for Generating Graphs with Constraint Programming. 32:1-32:16 - Andreas Schutt

, Matteo Cardellini
, Jip J. Dekker
, Daniel Harabor, Marco Maratea, Mauro Vallati
:
Constraint-Based In-Station Train Dispatching. 33:1-33:24 - Zhengyuan Shi, Wentao Jiang, Xindi Zhang, Jin Luo, Yun Liang, Zhufei Chu

, Qiang Xu:
DynamicSAT: Dynamic Configuration Tuning for SAT Solving. 34:1-34:23 - Konstantin Sidorov

, Imko Marijnissen
, Emir Demirovic:
Unite and Lead: Finding Disjunctive Cliques for Scheduling Problems. 35:1-35:24 - Florentina Voboril

, Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider:
Balancing Latin Rectangles with LLM-Generated Streamliners. 36:1-36:17 - Nils Weidmann:

Multi-League Sports Scheduling with Team Interdependencies: An Optimization Model. 37:1-37:19 - Dekel Zak, Jingyi Mei, Jean-Marie Lagniez, Alfons Laarman:

Reducing Quantum Circuit Synthesis to #SAT. 38:1-38:21 - Tianwei Zhang, Stefan Szeider:

The 3-Decomposition Conjecture: A SAT-Based Approach with Specialized Propagators. 39:1-39:19 - Ghiles Ziat, Martin Pépin:

An Efficient and Uniform CSP Solution Generator Generator. 40:1-40:18 - Miguel Antoons, Augustin Delecluse

, Samih Zein, Pierre Schaus:
Modeling and Solving a Composite Structure Design Problem with Constraint Programming (Short Paper). 41:1-41:9 - Jip J. Dekker

, Alexey Ignatiev, Peter J. Stuckey, Allen Z. Zhong
:
Towards Modern and Modular SAT for LCG (Short Paper). 42:1-42:12 - Michael Prümm

, Peter Nightingale, Felix Ulrich-Oltean:
Scheduling Telescope Observations for the European Southern Observatory (Short Paper). 43:1-43:10

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














