521 citations · 660 across the 21 of their papers we have counts for
4 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…
An Exact Framework for Solving the Space-Time Dependent TSP
Isaac Rudich, Quentin Cappart, Manuel López-Ibáñez +2
Many real-world scenarios involve solving bi-level optimization problems in which there is an outer discrete optimization problem, and an inner problem involving expensive or black…
Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams
Isaac Rudich, Quentin Cappart, Louis-Martin Rousseau
Decision diagrams are an increasingly important tool in cutting-edge solvers for discrete optimization. However, the field of decision diagrams is relatively new, and is still inco…
Learning a Generic Value-Selection Heuristic Inside a Constraint Programming Solver
Tom Marty, Tristan François, Pierre Tessier +3
Constraint programming is known for being an efficient approach for solving combinatorial problems. Important design choices in a solver are the branching heuristics, which are des…