1.1k citations · 1.4k across the 52 of their papers we have counts for
3 papers · 2 filters
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…
Artificial Intelligence/Operations Research Workshop 2 Report Out
John Dickerson, Bistra Dilkina, Yu Ding +9
This workshop Report Out focuses on the foundational elements of trustworthy AI and OR technology, and how to ensure all AI and OR systems implement these elements in their system…
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…