An Explicit Lower Bound for TSP with Distances One and Two
Lars EngebretsenPublished in: Electron. Colloquium Comput. Complex. (1998)
Keyphrases
- lower bound
- upper bound
- optimal solution
- np hard
- traveling salesman problem
- branch and bound algorithm
- branch and bound
- lower and upper bounds
- objective function
- ant colony optimization
- search space
- upper and lower bounds
- travelling salesman
- distance measure
- distance function
- lower bounding
- euclidean distance
- worst case
- data sets
- cost function
- genetic algorithm
- linear programming
- optimization problems
- dissimilarity measure
- knn
- quadratic assignment problem
- heuristic solution
- aco algorithms