Click here to access the Springer Proceedings (LINK to appear soon)

Accepted Papers

Fair Minimum Representation Clustering

Connor Lawless (Cornell University) and Oktay Gunluk (Cornell University).

Improving Metaheuristic Efficiency for Stochastic Optimization Problems by Sequential Predictive Sampling

Noah Schutte (Delft University of Technology), Krzysztof Postek (Independent Researcher) and Neil Yorke-Smith (Delft University of Technology).

Core Boosting in SAT-Based Multi-Objective Optimization

Christoph Jabs (HIIT, Department of Computer Science, University of Helsinki), Jeremias Berg (University of Helsinki) and Matti Järvisalo (University of Helsinki).

Local Alterations of the Lagrange Multipliers for Enhancing the Filtering of the AtMostNValue

Frédéric Berthiaume (Université Laval) and Claude-Guy Quimper (Laval University).

Learning From Scenarios for Repairable Stochastic Scheduling

Kim van den Houten (Delft University of Technology), David M.J. Tax (Delft University of Technology), Esteban Freydell (DSM-Firmenich) and Mathijs de Weerdt (Delft University of Technology).

Robustness Verification in Neural Networks

Adrian Wurm (BTU Cottbus).

Efficiently Mining Closed Interval Patterns with Constraint Programming

Djawad Bekkoucha (University of Caen Normandy), Abdelkader Ouali (University of Caen Normandy), Patrice Boizumault (University of Caen Normandy) and Bruno Cremilleux (University of Caen Normandy).

Decision-focused predictions via pessimistic bilevel optimization: a computational study

Víctor Bucarey (Universidad de O'Higgins), Sophia Calderón (Universidad de O'Higgins), Gonzalo Muñoz (Universidad de O'Higgins) and Frederic Semet (Centrale Lille).

ViolationLS: Constraint-Based Local Search in CP-SAT

Toby Davies (Google), Frédéric Didier (Google) and Laurent Perron (Google).

SMT-based Repair of Disjunctive Temporal Networks with Uncertainty: Strong and Weak Controllability

Ajdin Sumic (Technical University of Tarbes), Cimatti Alessandro (Fondazione Bruno Kessler), Micheli Andrea (Fondazione Bruno Kessler) and Thierry Vidal (Technical University of Tarbes).

Learning Heuristics for Combinatorial Optimization Problems on K-Partite Hypergraphs

Mehdi Zouitine (IRT Saint Exupéry; Institut de Mathématiques de Toulouse; Université de Toulouse), Ahmad Berjaoui (IRT Saint Exupéry), Agnès Lagnoux (Institut de Mathématique de Toulouse, UMR5219; Université de Toulouse, CNRS; UT2J), Clément Pellegrini (Institut de Mathématique de Toulouse, UMR5219; Université de Toulouse, CNRS; UT3) and Emmanuel Rachelson (ISAE-SUPAERO; Université de Toulouse).

Online optimization of a dial-and-ride problem with the integral primal simplex

Elahe Amiri (Polytechnique Montreal, CIRRELT, GERAD), Antoine Legrain (Polytechnique Montreal, CIRRELT, GERAD) and Issmaïl El Hallaoui (Polytechnique Montreal, GERAD).

Minimizing the Cost of Leveraging Influencers in Social Networks: IP and CP Approaches

Felipe de C. Pereira (Institute of Computing, University of Campinas), Pedro J. de Rezende (Institute of Computing, University of Campinas) and Tallys Yunes (Miami Herbert Business School, University of Miami).

Proof Logging for the Circuit Constraint

Matthew McIlree (University of Glasgow), Ciaran McCreesh (University of Glasgow) and Jakob Nordström (University of Copenhagen and Lund University).

Assessing Group Fairness with Social Welfare Optimization

Violet Chen (Stevens Institute of Technology), John Hooker (Carnegie Mellon University) and Derek Leben (Carnegie Mellon University).

Single Constant Multiplication for SAT

Hendrik Bierlee (Monash University), Jip J. Dekker (Monash University), Vitaly Lagoon (Cadence Design Systems), Peter J. Stuckey (Monash University) and Guido Tack (Monash University).

Accelerating Continuous Variable Coherent Ising Machines via Momentum

Robin Brown (Stanford University; USRA RIACS; NASA Quantum Artificial Intelligence Laboratory), Davide Venturelli (USRA Research Institute for Advanced Computer Science; NASA Quantum Artificial Intelligence Laboratory), Marco Pavone (Stanford University) and David Bernal Neira (Purdue University; USRA RIACS; NASA Quantum Artificial Intelligence Laboratory).

An Exploration of Exact Methods for Effective Network Failure Detection and Diagnosis

Auguste Burlats (UCLouvain), Pierre Schaus (UCLouvain) and Cristel Pelsser (UCLouvain).

Probabilistic Lookahead Strong Branching via a Stochastic Abstract Branching Model

Gioni Mexi (Zuse Institute Berlin (ZIB)), Somayeh Shamsi (Monash University), Mathieu Besançon (Zuse Institute Berlin) and Pierre Le Bodic (Monash University).

Bi-Objective Discrete Graphical Model Optimization

Samuel Buchet (MIAT - INRAE), David Allouche (MIAT - INRAE), Simon de Givry (MIAT - INRAE) and Thomas Schiex (MIAT - INRAE).

Optimization Over Trained Neural Networks: Taking a Relaxing Walk

Jiatai Tong (Bucknell University), Junyang Cai (University of Southern California) and Thiago Serra (Buckell University).

Learning to Solve Job Shop Scheduling under Uncertainty

Guillaume Infantes (Jolibrain), Stephanie Roussel (ONERA), Pierre Pereira (Jolibrain), Antoine Jacquet (Jolibrain) and Emmanuel Benazera (Jolibrain).

Modeling and Exploiting Dominance Rules for Discrete Optimization with Decision Diagrams

Vianney Coppé (UCLouvain), Xavier Gillard (UCLouvain) and Pierre Schaus (UCLouvain).

Don't Explain Noise: Robust Counterfactuals for Randomized Ensembles

Alexandre Forel (Polytechnique Montreal), Axel Parmentier (Ecole des Ponts) and Thibaut Vidal (Polytechnique Montreal).

A Constraint Programming Approach for Aircraft Disassembly Scheduling

Charles Thomas (UCLouvain, ICTEAM institute) and Pierre Schaus (UCLouvain).

A Benders decomposition approach for a capacitated multi-vehicle covering tour problem with intermediate facilities

Vera Fischer (University of Fribourg), Antoine Legrain (Polytechnique Montreal) and David Schindl (Geneva School of Business Administration).

Towards a Generic Representation of Combinatorial Problems for Learning-Based Approaches

Léo Boisvert (Polytechnique Montréal), Hélène Verhaeghe (DTAI, KULeuven) and Quentin Cappart (Polytechnique Montréal).

ULD Build-Up Scheduling with Logic-Based Benders Decomposition

Ricardo Euler (Zuse Institute Berlin (ZIB)), Ralf Borndoerfer (Zuse-Institute Berlin (ZIB)), Christian Puchert (Ab Ovo) and Tuomo Takkula (Ab Ovo).

An Improved Neuro-Symbolic Architecture to Fine-Tune Generative AI Systems

Chao Yin (Polytechnique Montréal), Quentin Cappart (Polytechnique Montréal) and Gilles Pesant (Polytechnique Montréal).

LEO: Learning Efficient Orderings for Multiobjective BDDs

Rahul Patel (University of Toronto) and Elias B. Khalil (University of Toronto).

A Constraint Programming Model for the Electric Bus Assignment Problem with Parking Constraints

Mathis Azema (Ecole Polytechnique), Guy Desaulniers (Ecole Polytechnique de Montréal), Jorge Mendoza (HEC Montréal) and Gilles Pesant (Ecole Polytechnique de Montréal).

Acquiring Constraints for a Non-linear Transmission Maintenance Scheduling Problem

Hugo Barral (Polytechnique Montréal), Mohamed Gaha (Institut de recherche d’Hydro-Québec), Amira Dems (Institut de recherche d’Hydro-Québec), Alain Côté (Institut de recherche d’Hydro-Québec), Franklin Nguewouo (Institut de recherche d’Hydro-Québec) and Quentin Cappart (Polytechnique Montréal).

Learning Deterministic Surrogates for Robust Convex QCQP

Egon Persak (University of Edinburgh) and Miguel Anjos (The University of Edinburgh).

UNSAT Solver Synthesis via Monte Carlo Forest Search

Chris Cameron (University of British Columbia), Jason Hartford (Valence AI), Taylor Lundy (University of British Columbia), Tuan Truong (University of British Columbia), Alan Milligan (University of British Columbia), Rex Chen (Carnegie Mellon University) and Kevin Leyton-Brown (University of British Columbia).

Strategies for Compressing the Pareto Frontier: Application to Strategic Planning of Hydropower in the Amazon Basin

Zhongdi Qu (Cornell University), Marc Grimson (Cornell University), Yue Mao (Cornell University), Sebastian Heilpern (Cornell University), Imanol Miqueleiz (Cornell University), Felipe Pacheco (Cornell University), Alexander Flecker (Cornell University) and Carla P. Gomes (Cornell University).

Certifying MIP-based Presolve Reductions for 0-1 Integer Linear Programs

Alexander Hoen (Zuse Institut Berlin), Andy Oertel (Lund University), Ambros Gleixner (HTW Berlin / Zuse Institut Berlin) and Jakob Nordström (Lund University/Cogenhagen University).

Efficient Structured Perceptron for NP-hard Combinatorial Optimization Problems

Bastián Véjar (KU Leuven), Gaël Aglin (UCLouvain), Siegfried Nijssen (UCLouvain), Pierre Schaus (UCLouvain), Tias Guns (KU Leuven) and Ali İrfan Mahmutoğulları (KU Leuven).

A hybrid approach integrating Generalized Arc Consistency and Differential Evolution for global optimization

Mariane R. S. Cassenote (UFPR), Guilherme A. Derenievicz (Universidade Federal do Paraná) and Fabiano Silva (UFPR).

Bound Tightening using Rolling-Horizon Decomposition for Neural Network Verification

Haoruo Zhao (Georgia Institute of Technology), Hassan Hijazi (Los Alamos National Laboratory), Haydn Jones (University of Pennsylvania), Juston Moore (Los Alamos National Laboratory), Mathieu Tanneau (Georgia Institute of Technology) and Pascal Van Hentenryck (Georgia Institute of Technology).

CaVE: A Cone-aligned Approach for Fast Predict-then-optimize with Binary Linear Programs

Bo Tang (University of Toronto) and Elias Khalil (University of Toronto).

Explainable Algorithm Selection for the Capacitated Lot Sizing Problem

Andrea Visentin (Insight Centre for Data Analytics), Aodh Ó Gallchóir (School of Computer Science & IT, University College Cork), Jens Kärcher (Department of Supply Chain Management, University of Hohenheim) and Herbert Meyr (Department of Supply Chain Management, University of Hohenheim).

Lookahead, Merge and Reduce for Compiling Relaxed Decision Diagrams for Optimization

Mohsen Nafar (Bielefeld University) and Michael Römer (Bielefeld University).

Accepted Extended Abstracts

tbd