Using Cost-Based Solution Densities from TSP Relaxations to Solve Routing Problems.

Pierre Coste Andrea Lodi Gilles Pesant

Published in: CPAIOR (2019)

Keyphrases

routing problem
traveling salesman problem
optimal solution
lower bound
minimum cost
vehicle routing problem
exact solution
np hard
linear programming
integer program
shortest path
video sequences
objective function
depth first search
ant colony optimization
global optimization
semidefinite