A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem.
Jean-François BérubéMichel GendreauJean-Yves PotvinPublished in: Networks (2009)
Keyphrases
- traveling salesman problem
- prize collecting
- combinatorial optimization
- ant colony optimization
- dynamic programming
- computational complexity
- simulated annealing
- ant colony optimization algorithm
- hamiltonian cycle
- convergence rate
- minimum spanning tree
- discrete particle swarm optimization
- search space
- convex hull
- solution quality
- integer programming