Towards Better Inapproximability Bounds for TSP: A Challenge of Global Dependencies.
Marek KarpinskiPublished in: FCT (2015)
Keyphrases
- traveling salesman problem
- upper bound
- upper and lower bounds
- lower bound
- tight bounds
- search engine
- global information
- search space
- approximation algorithms
- ant colony optimization
- travelling salesman
- real time
- multidatabase systems
- lower and upper bounds
- combinatorial optimization
- evolutionary algorithm
- image sequences
- knowledge base
- information systems
- artificial intelligence
- genetic algorithm
- real world