A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem.

Published in: APPROX-RANDOM (2008)

Keyphrases

lp relaxation
linear programming
linear program
subtour elimination
constraint satisfaction problems
branch and bound algorithm
knapsack problem
optimal solution
search space
multistage
integer programming
global optimum
soft constraints