9 citations · 21 across the 9 of their papers we have counts for
Showing 2023 · cs.AIShow all
2 papers · 2 filters
cs.AI2023★ 1 cited
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…
cs.AI2023★ 9 cited
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…