A Small Improvement to the Upper Bound on the Integrality Ratio for the s-t Path TSP.
Xianghui ZhongPublished in: CoRR (2020)
Keyphrases
- combinatorial optimization
- upper bound
- traveling salesman problem
- branch and bound algorithm
- lower bound
- branch and bound
- optimization problems
- worst case
- randomly distributed
- small number
- shortest path
- tight upper and lower bounds
- travelling salesman
- upper and lower bounds
- real time
- special case
- case study
- machine learning