A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery.
Hipólito Hernández-PérezJuan José Salazar GonzálezPublished in: Discret. Appl. Math. (2004)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- similarity measure
- computational complexity
- minimum spanning tree
- linear programming
- ant colony optimization
- objective function
- discrete particle swarm optimization
- hamiltonian cycle
- search space
- energy function
- optimization algorithm
- benchmark problems
- np hard
- search algorithm
- convex hull
- dynamic programming
- global optimization