Search Results for author: Swann Bessa

Found 1 papers, 0 papers with code

Learning Valid Dual Bounds in Constraint Programming: Boosted Lagrangian Decomposition with Self-Supervised Learning

no code implementations22 Aug 2024 Swann Bessa, Darius Dabert, Max Bourgeat, Louis-Martin Rousseau, Quentin Cappart

Lagrangian decomposition (LD) is a relaxation method that provides a dual bound for constrained optimization problems by decomposing them into more manageable sub-problems.

Self-Supervised Learning valid

Cannot find the paper you are looking for? You can Submit a new open access paper.