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: Electron. Colloquium Comput. Complex. (1999)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- optimization problems
- ant colony optimization
- ant colony optimization algorithm
- combinatorial problems
- evolutionary algorithm
- satisfy the triangle inequality
- transportation networks
- combinatorial optimization problems
- metaheuristic
- traveling salesman
- simulated annealing
- vehicle routing problem
- optimization algorithm
- hamiltonian cycle
- discrete particle swarm optimization
- discrete optimization problems
- valid inequalities
- optimization methods
- nature inspired
- branch and bound
- genetic local search