An improved upper bound on the integrality ratio for the s-t-path TSP.
Vera TraubJens VygenPublished in: Oper. Res. Lett. (2019)
Keyphrases
- upper bound
- lower bound
- traveling salesman problem
- tight upper and lower bounds
- branch and bound algorithm
- branch and bound
- shortest path
- worst case
- search space
- ant colony optimization
- upper and lower bounds
- optimal solution
- lower and upper bounds
- error probability
- sample complexity
- genetic algorithm
- travelling salesman
- linear programming relaxation
- optimal path
- mixed integer
- np hard
- linear systems
- real time
- minimum cost
- standard deviation
- case study
- integer program
- constant factor
- combinatorial optimization
- linear programming
- cost function