Approximation algorithms for the traveling salesman problem.
Jérôme MonnotVangelis Th. PaschosSophie ToulousePublished in: Math. Methods Oper. Res. (2003)
Keyphrases
- traveling salesman problem
- approximation algorithms
- special case
- np hard
- combinatorial optimization
- ant colony optimization
- worst case
- optimization problems
- combinatorial problems
- vertex cover
- minimum cost
- hamiltonian cycle
- constant factor
- traveling salesman
- primal dual
- combinatorial optimization problems
- approximation ratio
- transportation networks
- valid inequalities
- constant factor approximation
- exact algorithms
- crossover operator
- vehicle routing problem
- multi objective
- minimum spanning tree
- tabu search
- metaheuristic
- evolutionary algorithm
- genetic algorithm