A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks.
Manuel A. Alba MartínezJean-François CordeauMauro Dell'AmicoManuel IoriPublished in: INFORMS J. Comput. (2013)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- minimum spanning tree
- cost function
- ant colony optimization
- optimization algorithm
- computational complexity
- discrete particle swarm optimization
- hamiltonian cycle
- energy function
- expectation maximization
- dynamic programming
- optimal solution
- similarity search
- distance function
- np complete
- particle swarm optimization
- np hard
- ant colony optimization algorithm
- search space