Computing an Upper Bound for the Longest Edge in an Optimal TSP-Solution.
Hans AchatzPeter KleinschmidtPublished in: OR (2013)
Keyphrases
- upper bound
- optimal solution
- lower bound
- optimal cost
- worst case
- constant factor
- branch and bound algorithm
- branch and bound
- search space
- np hard
- closed form
- dynamic programming
- greedy heuristic
- traveling salesman problem
- heuristic solution
- solution quality
- minimum cost
- travelling salesman
- single item
- data sets
- minimum distance
- lower and upper bounds
- edge information
- special case
- finding optimal
- control policy
- linear equations
- locally optimal
- optimal or near optimal
- genetic algorithm
- neural network