Slightly improved upper bound on the integrality ratio for the s-t Path TSP.
Xianghui ZhongPublished in: Oper. Res. Lett. (2020)
Keyphrases
- upper bound
- lower bound
- branch and bound algorithm
- traveling salesman problem
- branch and bound
- ant colony optimization
- tight upper and lower bounds
- worst case
- lower and upper bounds
- neural network
- xml documents
- error probability
- machine learning
- generalization error
- optimal solution
- travelling salesman
- single item
- information retrieval
- information systems
- special case
- combinatorial optimization
- search space
- optimization problems
- real time
- scheduling problem
- dynamic programming