A branch-and-cut algorithm for the undirected selective traveling salesman problem.
Michel GendreauGilbert LaporteFrédéric SemetPublished in: Networks (1998)
Keyphrases
- traveling salesman problem
- computational complexity
- ant colony optimization
- optimal solution
- objective function
- hamiltonian cycle
- dynamic programming
- discrete particle swarm optimization
- ant colony optimization algorithm
- benchmark problems
- combinatorial optimization
- np hard
- constraint satisfaction problems
- expectation maximization
- cost function
- weighted graph
- undirected graph
- evolutionary algorithm
- search space
- traveling salesman
- lower bound