Polyhedral results and a branch-and-cut algorithm for the double traveling Salesman problem with multiple stacks.
Michele BarbatoRoland GrappeMathieu LacroixRoberto Wolfler CalvoPublished in: Discret. Optim. (2016)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- hamiltonian cycle
- np hard
- dynamic programming
- cost function
- ant colony optimization
- neural network
- objective function
- optimal solution
- computational complexity
- optimization problems
- convex hull
- genetic local search
- discrete particle swarm optimization
- combinatorial optimization problems
- knapsack problem
- constraint satisfaction
- energy function
- similarity measure