Table of Contents

• Learning Lagrangian Multipliers for the Travelling Salesman ProblemAugustin Parjadis, Quentin Cappart, Bistra Dilkina, Aaron M. Ferber, Louis-Martin Rousseau. [doi]
• Cumulative Scheduling with Calendars and OvertimeSamuel Cloutier, Claude-Guy Quimper. [doi]
• Solving LBBD Master Problems with Constraint Programming and Domain-Independent Dynamic ProgrammingJiachen Zhang, J. Christopher Beck. [doi]
• Improved Bounds of Integer Solution Counts via Volume and Extending to Mixed-Integer Linear ConstraintsCunjing Ge, Armin Biere. [doi]
• Learning Precedences for Scheduling Problems with Graph Neural NetworksHélène Verhaeghe, Quentin Cappart, Gilles Pesant, Claude-Guy Quimper. [doi]
• Constraint Modelling with LLMs Using In-Context LearningKostis Michailidis, Dimos Tsouros, Tias Guns. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Frugal Algorithm Selection (Short Paper)Erdem Kus, Özgür Akgün, Nguyen Dang 0001, Ian Miguel. [doi]
• The Complexity of Symmetry Breaking Beyond Lex-LeaderMarkus Anders, Sofia Brenner, Gaurav Rattan. [doi]
• Inverting Step-Reduced SHA-1 and MD5 by Parameterized SAT SolversOleg Zaikin 0002. [doi]
• Pseudo-Boolean Reasoning About States and Transitions to Certify Dynamic Programming and Decision Diagram AlgorithmsEmir Demirovic, Ciaran McCreesh, Matthew J. McIlree, Jakob Nordström, Andy Oertel, Konstantin Sidorov. [doi]
• Efficient Implementation of the Global Cardinality Constraint with CostsMargaux Schmied, Jean-Charles Régin. [doi]
• Latency-Aware 2-Opt Monotonic Local Search for Distributed Constraint OptimizationBen Rachmut, Roie Zivan, William Yeoh 0001. [doi]
• A New Optimization Model for Multiple-Control Toffoli Quantum Circuit DesignJihye Jung, Kevin Dalmeijer, Pascal Van Hentenryck. [doi]
• Encoding the Hamiltonian Cycle Problem into SAT Based on Vertex Elimination (Short Paper)Neng-Fa Zhou. [doi]
• Solving Patience and Solitaire Games with Good Old Fashioned AI (Invited Talk)Ian P. Gent. [doi]
• Black-Box Value Heuristics for Solving Optimization Problems with Constraint Programming (Short Paper)Augustin Delecluse, Pierre Schaus. [doi]
• A CP/LS Heuristic Method for Maxmin and Minmax Location Problems with Distance ConstraintsPanteleimon Iosif, Nikolaos Ploskas, Kostas Stergiou 0001, Dimosthenis C. Tsouros. [doi]
• Exponential Steepest Ascent from Valued Constraint Graphs of Pathwidth FourArtem Kaznatcheev, Melle van Marle. [doi]
• Constraint Programming Model for Assembly Line Balancing and Scheduling with Walking Workers and Parallel StationsXavier Pucel, Stéphanie Roussel 0001. [doi]
• ParLS-PBO: A Parallel Local Search Solver for Pseudo Boolean OptimizationZhihan Chen, Peng Lin, Hao Hu, Shaowei Cai 0001. [doi]
• Slide&Drill, a New Approach for Multi-Objective Combinatorial OptimizationJoão Cortes, Inês Lynce, Vasco M. Manquinho. [doi]
• On the Complexity of Integer Programming with Fixed-Coefficient Scaling (Short Paper)Jorke M. de Vlas. [doi]
• Ex-Ante Constraint Elicitation in Incomplete DCOPsRoie Zivan, Shiraz Regev, William Yeoh 0001. [doi]
• An Efficient Local Search Solver for Mixed Integer ProgrammingPeng Lin, Mengchuan Zou, Shaowei Cai 0001. [doi]
• An Investigation of Generic Approaches to Large Neighbourhood Search (Short Paper)Filipe Souza, Diarmuid Grimes, Barry O'Sullivan. [doi]
• Thinking Fast and Slow in AI: A Cognitive Architecture to Augment Both AI and Human Reasoning (Invited Talk)Francesca Rossi 0001. [doi]
• Minimizing Working-Group Conflicts in Conference Session Scheduling Through Maximum Satisfiability (Short Paper)Sami Cherif, Heythem Sattoutah, Chu Min Li, Corinne Lucet, Laure Brisoux Devendeville. [doi]
• Using Constraint Programming for Disjunctive Scheduling in Temporal AI PlanningAdam Francis Green, J. Christopher Beck, Amanda Jane Coles. [doi]
• Strengthening Relaxed Decision Diagrams for Maximum Independent Set Problem: Novel Variable Ordering and Merge HeuristicsMohsen Nafar, Michael Römer. [doi]
• Computing Small Rainbow Cycle Numbers with SAT Modulo Symmetries (Short Paper)Markus Kirchweger, Stefan Szeider. [doi]
• CSPs with Few Alien ConstraintsPeter Jonsson, Victor Lagerkvist, George Osipov. [doi]
• Deep Cooperation of Local Search and Unit Propagation TechniquesXiamin Chen, Zhendong Lei, Pinyan Lu. [doi]
• A Multi-Stage Proof Logging Framework to Certify the Correctness of CP SolversMaarten Flippo, Konstantin Sidorov, Imko Marijnissen, Jeff Smits, Emir Demirovic. [doi]
• Certifying Without Loss of Generality Reasoning in Solution-Improving Maximum SatisfiabilityJeremias Berg, Bart Bogaerts 0001, Jakob Nordström, Andy Oertel, Tobias Paxian, Dieter Vandesande. [doi]
• Combining Constraint Programming Reasoning with Large Language Model PredictionsFlorian Régin, Elisabetta De Maria, Alexandre Bonlarron. [doi]
• Anytime Weighted Model Counting with Approximation Guarantees for Probabilistic InferenceAlexandre Dubray, Pierre Schaus, Siegfried Nijssen. [doi]
• Mutational Fuzz Testing for Constraint Modeling SystemsWout Vanroose, Ignace Bleukx, Jo Devriendt, Dimos Tsouros, Hélène Verhaeghe, Tias Guns. [doi]
• Structure-Guided Local Improvement for Maximum SatisfiabilityAndré Schidler, Stefan Szeider. [doi]
• Learning Effect and Compound Activities in High Multiplicity RCPSP: Application to Satellite ProductionDuc-Anh Le, Stéphanie Roussel 0001, Christophe Lecoutre, Anouck Chan. [doi]
• CP for Bin Packing with Multi-Core and GPUsFabio Tardivo, Laurent Michel, Enrico Pontelli. [doi]