Login / Signup

A simple LP relaxation for the asymmetric traveling salesman problem.

Thành Nguyen
Published in: Math. Program. (2013)
Keyphrases
  • lp relaxation
  • subtour elimination
  • linear programming
  • higher order
  • traveling salesman problem
  • optimal solution
  • special case
  • np complete
  • linear program
  • feasible solution