7 citations · 8 across the 2 of their papers we have counts for
2 papers
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.LG2022★ 7 cited
The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights
Maxime Gasse, Quentin Cappart, Jonas Charfreitag +38
Combinatorial optimization is a well-established area in operations research and computer science. Until recently, its methods have focused on solving problem instances in isolatio…