An Explicit Lower Bound for TSP with Distances One and Two.
Lars EngebretsenPublished in: Algorithmica (2003)
Keyphrases
- lower bound
- optimal solution
- upper bound
- np hard
- traveling salesman problem
- travelling salesman
- branch and bound algorithm
- heuristic solution
- branch and bound
- worst case
- distance function
- lower bounding
- search space
- distance measure
- objective function
- quadratic assignment problem
- optimization problems
- combinatorial optimization
- nearest neighbor
- lagrangian relaxation
- upper and lower bounds
- evolutionary algorithm
- search algorithm
- lower and upper bounds
- vc dimension
- aco algorithms
- traveling salesman
- sufficiently accurate