The Kth Traveling Salesman Problem is Pseudopolynomial when TSP is polynomial.
Brahim ChaourarPublished in: CoRR (2017)
Keyphrases
- traveling salesman problem
- subtour elimination
- combinatorial optimization
- ant colony optimization
- action recognition
- optimization problems
- combinatorial problems
- transportation networks
- discrete optimization problems
- combinatorial optimization problems
- ant colony optimization algorithm
- discrete particle swarm optimization
- genetic local search
- traveling salesman
- hamiltonian cycle
- vehicle routing problem
- lin kernighan
- neural network
- valid inequalities
- crossover operator
- swarm intelligence
- dynamic programming