Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem.
Hans-Joachim BöckenhauerJuraj HromkovicRalf KlasingSebastian SeibertWalter UngerPublished in: CIAC (2000)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- optimization problems
- combinatorial optimization problems
- combinatorial problems
- ant colony optimization
- satisfy the triangle inequality
- transportation networks
- evolutionary algorithm
- discrete optimization
- ant colony optimization algorithm
- discrete particle swarm optimization
- optimization algorithm
- branch and bound
- global optimization
- traveling salesman
- crossover operator
- nature inspired
- discrete optimization problems
- optimization methods
- valid inequalities
- vehicle routing problem
- metaheuristic
- hamiltonian cycle
- cost function
- genetic algorithm
- genetic local search
- approximation algorithms
- lower bound