New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization.
Santosh N. KabadiPublished in: Discret. Appl. Math. (2002)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- polynomially solvable
- lin kernighan
- traveling salesman
- benchmark instances
- variable neighborhood search
- np complete
- special case
- np hard
- feasible solution
- minimum spanning tree
- ant colony optimization
- processing times
- optimization problems
- combinatorial problems
- vehicle routing problem
- satisfy the triangle inequality
- combinatorial optimization problems
- metaheuristic
- hamiltonian cycle
- crossover operator
- simulated annealing
- objective function
- neural network
- mathematical model
- valid inequalities
- dynamic programming
- optimal solution
- minimum cost
- single machine
- heuristic methods
- quadratic assignment problem
- path relinking
- discrete optimization problems