Polynomially Solvable Cases of the Traveling Salesman Problem and a New Exponential Neighborhood.
Rainer E. BurkardVladimir G. DeinekoPublished in: Computing (1995)
Keyphrases
- traveling salesman problem
- polynomially solvable
- combinatorial optimization
- ant colony optimization
- combinatorial problems
- np complete
- ant colony optimization algorithm
- crossover operator
- special case
- optimization problems
- combinatorial optimization problems
- hamiltonian cycle
- processing times
- genetic local search
- discrete optimization problems
- valid inequalities
- discrete particle swarm optimization
- minimum spanning tree
- np hard
- traveling salesman
- vehicle routing problem
- minimum cost
- discrete optimization
- computational complexity
- neural network
- feasible solution
- metaheuristic
- scheduling problem
- dynamic programming
- evolutionary algorithm