Reusing the NP-Hard Traveling-Salesman Problem to Demonstrate That P~NP (Invited Paper).
Stuart H. RubinThouraya Bouabana-TebibelYasmin HoadjliZahira GhalemPublished in: IRI (2016)
Keyphrases
- traveling salesman problem
- invited paper
- np hard
- vehicle routing problem
- ant colony optimization
- combinatorial optimization
- ant colony optimization algorithm
- optimization problems
- computational complexity
- linear programming
- scheduling problem
- approximation algorithms
- crossover operator
- data analysis
- traveling salesman
- discrete optimization problems
- tabu search
- np complete
- special case
- data mining
- hamiltonian cycle