An approximation algorithm for a bottleneck traveling salesman problem.
Ming-Yang KaoManan SanghiPublished in: J. Discrete Algorithms (2009)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- hamiltonian cycle
- ant colony optimization
- dynamic programming
- particle swarm optimization
- traveling salesman
- computational complexity
- search space
- np hard
- discrete particle swarm optimization
- benchmark problems
- objective function
- expectation maximization
- minimum spanning tree
- genetic local search
- energy function
- linear programming
- cost function