NP=P: From Polynomial Time Approximation Bounded Solutions of TSP.
Wenhong TianPublished in: CoRR (2016)
Keyphrases
- polynomial time approximation
- np hard
- optimal solution
- traveling salesman problem
- aco algorithms
- computational complexity
- approximation algorithms
- error bounds
- genetic algorithm
- np complete
- search space
- linear programming
- worst case
- ant colony optimization
- scheduling problem
- feasible solution
- branch and bound algorithm
- solution quality
- lower bound
- search algorithm
- vertex cover
- learning algorithm