Improved lower bounds on the approximability of the Traveling Salesman Problem.
Hans-Joachim BöckenhauerSebastian SeibertPublished in: RAIRO Theor. Informatics Appl. (2000)
Keyphrases
- traveling salesman problem
- lower bound
- combinatorial optimization
- ant colony optimization
- upper bound
- ant colony optimization algorithm
- optimization problems
- traveling salesman
- combinatorial problems
- combinatorial optimization problems
- branch and bound
- vehicle routing problem
- quadratic assignment problem
- crossover operator
- discrete particle swarm optimization
- lower and upper bounds
- hamiltonian cycle
- objective function
- worst case
- genetic local search
- valid inequalities
- branch and bound algorithm
- linear programming relaxation
- evolutionary algorithm
- discrete optimization problems
- satisfy the triangle inequality
- computational complexity