On the generation of metric TSP instances with a large integrality gap by branch-and-cut.
Eleonora VercesiStefano GualandiMonaldo MastrolilliLuca Maria GambardellaPublished in: Math. Program. Comput. (2023)
Keyphrases
- integrality gap
- valid inequalities
- traveling salesman problem
- linear programming relaxation
- triangle inequality
- linear program
- knapsack problem
- integer programming formulation
- linear programming
- lower bound
- quadratic assignment problem
- optimal solution
- integer programming
- metric space
- ant colony optimization
- primal dual
- approximation algorithms
- randomly generated
- column generation
- arbitrarily close
- mixed integer programming
- randomly generated problems
- feasible solution
- optimization problems
- combinatorial optimization
- np hard
- distance metric
- lp relaxation
- metric learning
- dynamic programming
- search space
- branch and bound algorithm
- branch and bound
- genetic algorithm