The Kth TSP is pseudopolynomial when TSP is polynomial.
Brahim ChaourarPublished in: Discret. Math. Algorithms Appl. (2018)
Keyphrases
- traveling salesman problem
- travelling salesman
- subtour elimination
- ant colony optimization
- search space
- optimal solution
- genetic algorithm
- document identifiers
- np hard
- combinatorial optimization
- cost function
- linear programming
- data mining
- probabilistic model
- optimization problems
- expert systems
- support vector
- heuristic solution
- image processing
- knowledge base