Workshop Schedule

Invited Talks

Schedule

Invited talk 09:00 – 10:00

Chair: Simon de Givry

  • 09:00-10:00 Combining Constraint Programming and Machine Learning: From Current Progress to Future Opportunities by Quentin Cappart (UCLouvain and Polytechnique Montréal)

Coffee Break 10:00 – 10:30

Session 1 10:30 – 12:00

Chair: Simon de Givry

  • 10:30-11:00 On the use of ML and LLM for hard scheduling problems by Guillaume Povéda (Airbus SAS), Florent Teichteil-Koenigsbuch (Airbus SAS)
  • 11:00-11:30 Learning Unified Graph and Language Representations for SMT Algorithm Selection (accepted to CP 2026) by Zhengyang John Lu (University of Waterloo), Paul Sarnighausen-Cahn (University of Göttingen and CIDAS), Jiahao Chen (Georgia Institute of Technology), Arie Gurfinkel (University of Waterloo), Florin Manea (University of Göttingen and CIDAS), Vijay Ganesh (Georgia Institute of Technology)
  • 11:30-12:00 Efficiently Solving Constraint Optimization Problems Using Learning-Based Techniques by Romaissa GHLIB (GREYC, CNRS, Normandie Univ, ENSICAEN, Université de Caen Normandie, Caen, France), Abdelkader OUALI (GREYC, CNRS, Normandie Univ, ENSICAEN, Université de Caen Normandie, Caen, France), Jeab-Luc LAMOTTE (GREYC, CNRS, Normandie Univ, ENSICAEN, Université de Caen Normandie, Caen, France), Samir Loudni (TASC (LS2N-CNRS), IMT Atlantique, 44307, Nantes, France)

Lunch 12:00 – 14:00

Session 2 14:00 – 15:30

Chair: Simon de Givry

  • 14:00-14:30 Aperture: an Anytime, Complete, and Incremental Solver for MaxSAT and Beyond (Work-in-Progress) by Alexander Nadel, Yam Slonimski, Ofer Strichman (Technion, Haifa, Israel)
  • 14:30-15:00 Certified Implicit Hitting Set Solving with Local Search for Pseudo-Boolean Optimization by Benjamin Bogø (University of Copenhagen and Lund University), Xiamin Chen (Shanghai University of Finance and Economics), Wietze Koops (Lund University and University of Copenhagen), Pinyan Lu (Shanghai University of Finance and Economics and Huawei Taylor Lab), Jakob Nordström (University of Copenhagen and Lund University), Marc Vinyals (University of Auckland), Qingzhao Wu (Shanghai University of Finance and Economics)
  • 15:00-15:30 Enhanced Lower Bound Computation in Branch-and-Bound for MaxSAT (accepted to CP 2026) by Jialu Zhang (MIS UR 4290, Université de Picardie Jules Verne, Amiens, France), Chu-Min Li (MIS UR 4290, Université de Picardie Jules Verne, Amiens, France), Sami Cherif (MIS UR 4290, Université de Picardie Jules Verne, Amiens, France), Shuolin Li (Aix Marseille Univ, Université de Toulon, CNRS, LIS, Marseille, France)

Coffee Break 15:30 – 16:00

Session 3 16:00 – 17:30

Chair: Guillaume Povéda (Airbus SAS, Toulouse, France)

  • 16:00-16:30 Fair Constraint Satisfaction: An Approximate Algorithm and Preliminary Results by Javier Larrosa (UPC Barcelona), David García-Soriano (UPC Barcelona), Miguel Escribano (UPC Barcelona)
  • 16:30-17:00 Pseudo-Boolean Conflict Analysis by Benjamin Bogø (University of Copenhagen and Lund University), Wietze Koops (Lund University and University of Copenhagen), Jakob Nordström (University of Copenhagen and Lund University), Alexander Tesch (Bool AI, Berlin)
  • 17:00-17:30 Quadratic Assignment Problems in Cost Function Networks (extended version of CPAIOR 2026) by Guidio Sewa (INRAE Toulouse), Coralie Marchau (IMT Atlantique), David Allouche (INRAE Toulouse), Simon de Givry (INRAE Toulouse), George Katsirelos (INRAE Paris-Saclay), Thomas Schiex (INRAE Toulouse)

Back To Top