PPaperPicks
← All conferences
Editions20262025

CP 2025

A

International Conference on Principles and Practice of Constraint Programming

Official site ↗
44
accepted papers
121
authors
August 10-15, 2025
dates
Scotland
location

44 / 44 papers

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