9 citations · 21 across the 9 of their papers we have counts for
3 papers · 1 filter
Learning Lagrangian Multipliers for the Travelling Salesman Problem
Augustin Parjadis, Quentin Cappart, Bistra Dilkina +2
Lagrangian relaxation is a versatile mathematical technique employed to relax constraints in an optimization problem, enabling the generation of dual bounds to prove the optimality…
Searching Large Neighborhoods for Integer Linear Programs with Contrastive Learning
Taoan Huang, Aaron Ferber, Yuandong Tian +2
Integer Linear Programs (ILPs) are powerful tools for modeling and solving a large number of combinatorial optimization problems. Recently, it has been shown that Large Neighborhoo…
Local Branching Relaxation Heuristics for Integer Linear Programs
Taoan Huang, Aaron Ferber, Yuandong Tian +2
Large Neighborhood Search (LNS) is a popular heuristic algorithm for solving combinatorial optimization problems (COP). It starts with an initial solution to the problem and iterat…