Approximation hardness of deadline-TSP reoptimization.
Hans-Joachim BöckenhauerJoachim KneisJoachim KupkePublished in: Theor. Comput. Sci. (2009)
Keyphrases
- traveling salesman problem
- np hard
- approximation algorithms
- genetic algorithm
- travelling salesman
- computational complexity
- cost model
- phase transition
- error bounds
- np complete
- special case
- approximation methods
- case study
- search space
- approximation error
- optimal solution
- learning theory
- approximation schemes
- np hardness
- continuous functions
- queueing networks
- satisfy the triangle inequality
- resource constraints
- information retrieval
- scheduling algorithm
- information theoretic
- ant colony optimization
- linear programming
- worst case
- objective function
- lower bound