An Optimal Lower Bound for Hierarchical Universal Solutions for TSP on the Plane.
Patrick EadesJulián MestrePublished in: COCOON (2020)
Keyphrases
- lower bound
- optimal solution
- upper bound
- worst case
- np hard
- competitive ratio
- optimal cost
- branch and bound algorithm
- linear programming
- traveling salesman problem
- ant colony optimization
- hierarchical structure
- three dimensional
- branch and bound
- metaheuristic
- lagrangian relaxation
- constant factor
- travelling salesman
- lower and upper bounds
- sample complexity
- linear program
- optimization problems
- dynamic programming
- evolutionary algorithm
- objective function