Technical Note - Rounding Symmetric Traveling Salesman Problems with an Asymmetric Assignment Problem.
Roy JonkerG. De LeveJ. A. Van Der VeldeA. VolgenantPublished in: Oper. Res. (1980)
Keyphrases
- traveling salesman problem
- satisfy the triangle inequality
- bayesian decision problems
- decision problems
- combinatorial optimization
- ant colony optimization
- combinatorial optimization problems
- approximation algorithms
- hamiltonian cycle
- triangle inequality
- vehicle routing problem
- np hard
- discrete optimization problems
- combinatorial problems
- linear programming
- optimization problems
- distribution network
- traveling salesman
- mixed integer
- edge weights