An Explicit Lower Bound for TSP with Distances One and Two.
Lars EngebretsenPublished in: STACS (1999)
Keyphrases
- lower bound
- optimal solution
- upper bound
- np hard
- branch and bound algorithm
- traveling salesman problem
- branch and bound
- worst case
- objective function
- lower bounding
- combinatorial optimization
- search space
- genetic algorithm
- travelling salesman
- lower and upper bounds
- upper and lower bounds
- heuristic solution
- ant colony optimization
- dissimilarity measure
- vc dimension
- sufficiently accurate
- euclidean distance
- linear program
- distance function
- optimization problems
- column generation