An improved lower bound for the Traveling Salesman constant.
Julia GaudioPatrick JailletPublished in: Oper. Res. Lett. (2020)
Keyphrases
- traveling salesman
- lower bound
- quadratic assignment problem
- upper bound
- branch and bound algorithm
- traveling salesman problem
- branch and bound
- lower and upper bounds
- worst case
- optimal solution
- constant factor
- sufficiently accurate
- lagrangian relaxation
- global optimization
- np hard
- knapsack problem
- randomly generated
- tabu search
- objective function
- max sat
- optimization problems
- multi class