A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem.
Matteo FischettiJuan José Salazar GonzálezPaolo TothPublished in: Oper. Res. (1997)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- ant colony optimization
- computational complexity
- discrete particle swarm optimization
- objective function
- traveling salesman
- hamiltonian cycle
- dynamic programming
- cost function
- simulated annealing
- particle swarm optimization
- convex hull
- np hard
- neural network
- metaheuristic
- scheduling problem
- minimum spanning tree
- ant colony optimization algorithm
- optimal solution