CP 2025 Accepted Papers

  • Transformer-based Feature Learning for Algorithm Selection in Combinatorial Optimisation
    Alessio Pellegrino, Özgür Akgün, Nguyen Dang, Zeynep Kiziltan, and Ian Miguel
  • Constraint-based In-Station Train Dispatching
    Andreas Schutt, Matteo Cardellini, Jip J. Dekker, Daniel Harabor, Marco Maratea, and Mauro Vallati
  • Greed is slow on sparse graphs of oriented valued constraints
    Artem Kaznatcheev and Sofia Vazquez Alferez
  • Analyzing Self-stabilization of Synchronous Unison via Propositional Satisfiability
    Asma Khoualdia, Sami Cherif, Stéphane Devismes, and Léo Robert
  • Learning to Bound for Maximum Common Subgraph Algorithms
    Buddhi W. Kothalawala, Henning Koehler, and Qing Wang
  • Transition Dominance in Domain-Independent Dynamic Programming
    J. Christopher Beck, Ryo Kuroiwa, Jimmy H.M. Lee, Peter J. Stuckey, and Allen Z. Zhong
  • Guess and Prove: A Hybrid Approach to Linear Polynomial Recovery in Circuit Verification
    Clemens Hofstadler and Daniela Kaufmann
  • Exact Methods for the Travelling Salesperson Problem with Self-Deleting Graphs
    Daniel Pekar and J. Christopher Beck
  • Reducing Quantum Circuit Synthesis to #SAT
    Dekel Zak, Jingyi Mei, Jean-Marie Lagniez, and Alfons Laarman
  • Aircraft Resource-Constrained Assembly Line Balancing with Learning Effect: a Constraint Programming Approach
    Duc Anh Le, Stéphanie Roussel, and Christophe Lecoutre
  • Disjunctive Scheduling in Tempo
    Emmanuel Hebrard
  • Balancing Latin Rectangles with LLM-generated Streamliners
    Florentina Voboril, Vaidyanathan Peruvemba Ramaswamy, and Stefan Szeider
  • Dependency-Curated Large Neighbourhood Search
    Frej Knutar Lewander, Pierre Flener, and Justin Pearson
  • An Efficient and Uniform CSP Solution Generator Generator
    Ghiles Ziat and Martin Pépin
  • Symmetric Core Learning for Pseudo-Boolean Optimization by Implicit Hitting Sets
    Hannes Ihalainen, Jeremias Berg, Matti Järvisalo, and Bart Bogaerts
  • Modeling and Explaining an Industrial Workforce Allocation and Scheduling Problem
    Ignace Bleukx, Ryma Bouzazouma, Tias Guns, Nadine Laage, and Guillaume Poveda
  • PrintTalk: A Language for Constraint-based 3D Modelling
    Jef Jacobs, Wolfgang De Meuter, and Jens Nicolay
  • Unit Types for MiniZinc
    Jip J. Dekker, Jason Nguyen, Peter J. Stuckey, and Guido Tack
  • Unite and Lead: Finding Disjunctive Cliques for Scheduling Problems
    Konstantin Sidorov, Imko Marijnissen, and Emir Demirović
  • Optimizing 2D Cutting: A Bin Packing Approach to Minimize Scraps and Maximize their Reusability
    Manuel Chastenay, Xavier Zwingmann, Claude-Guy Quimper, and Jonathan Gaudreault
  • Breaking Symmetries with Involutions
    Michael Codish and Mikolas Janota
  • An Expansion-Based Approach for Quantified Integer Programming
    Michael Hartisch and Leroy Chew
  • The Work Task Variation Problem
    Mikael Z. Lagerkvist and Magnus Rattfeldt
  • Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks
    Mohimenul Kabir, Van-Giang Trinh, Samuel Pastva, and Kuldeep S Meel
  • Constraint Models for Klondike
    Nguyen Dang, Ian P. Gent, Peter Nightingale, Felix Ulrich-Oltean, and Jack Waller
  • Multi-League Sports Scheduling with Team Interdependencies: An Optimization Model
    Nils Weidmann
  • SLS-Enhanced Core-Boosted Linear Search for Anytime Maximum Satisfiability
    Ole Lübke and Jeremias Berg
  • Parallel MIP Solving with Dynamic Task Decomposition
    Peng Lin, Shaowei Cai, Mengchuan Zou, and Shengqi Chen
  • Conflict Analysis Based on Cutting-Planes for Constraint Programming
    Robbin Baauw, Maarten Flippo, and Emir Demirović
  • RPID: Rust Programmable Interface for Domain-Independent Dynamic Programming
    Ryo Kuroiwa and J. Christopher Beck
  • The 3-Decomposition Conjecture: A SAT-Based Approach with Specialized Propagators
    Tianwei Zhang and Stefan Szeider
  • Understanding the Impact of Value Selection Heuristics in Scheduling Problems
    Tim Luchterhand, Emmanuel Hebrard, and Sylvie Thiebaux
  • Solving the Agile Earth Observation Satellite Scheduling Problem with CP and Local Search
    Valentin Antuori, Damien T. Wojtowicz, and Emmanuel Hebrard
  • Practically Feasible Proof Logging for Pseudo-Boolean Optimization
    Wietze Koops, Daniel Le Berre, Magnus O. Myreen, Jakob Nordström, Andy Oertel, Yong Kiam Tan, and Marc Vinyals
  • BFS-Based Canonical Codes for Generating Graphs with Constraint Programming
    Xiao Peng and Christine Solnon
  • From Prediction to Action: A Constraint-Based Approach to Predictive Policing
    Younes Mechqrane and Ismail Elabbassi
  • Cargo Routing Optimization in Liner Shipping Networks
    Yousra El Ghazi, Djamal Habet, and Cyril Terrioux
  • DynamicSAT: Dynamic Configuration Tuning for SAT Solving
    Zhengyuan Shi, Wentao Jiang, Xindi Zhang, Jin Luo, Yun Liang, Zhufei Chu, and Qiang Xu
  • Towards Modern and Modular SAT for LCG
    Jip J. Dekker, Alexey Ignatiev, Peter J. Stuckey, and Allen Z. Zhong
  • Scheduling Telescope Observations for the European Southern Observatory
    Michael Prümm, Peter Nightingale, and Felix Ulrich-Oltean
  • Modeling and Solving a Composite Structure Design Problem with Constraint Programming
    Miguel Antoons, Augustin Delecluse, Samih Zein, and Pierre Schaus