A Tight Lower Bounding Procedure for the Dubins Traveling Salesman Problem.
Satyanarayana G. ManyamSivakumar RathinamPublished in: CoRR (2015)
Keyphrases
- traveling salesman problem
- lower bounding
- lower bound
- branch and bound algorithm
- combinatorial optimization
- upper bound
- lower and upper bounds
- mathematical programming
- ant colony optimization
- subtour elimination
- multi step
- dynamic time warping
- branch and bound
- traveling salesman
- valid inequalities
- vehicle routing problem
- euclidean distance
- np hard
- optimal solution
- optimization problems
- similarity search
- objective function
- edit distance
- tabu search
- computational complexity
- distance computation
- particle swarm optimization