An improved upper bound on the integrality ratio for the s-t-path TSP.
Vera TraubJens VygenPublished in: CoRR (2018)
Keyphrases
- upper bound
- lower bound
- traveling salesman problem
- tight upper and lower bounds
- branch and bound algorithm
- upper and lower bounds
- worst case
- branch and bound
- ant colony optimization
- travelling salesman
- lower and upper bounds
- optimal solution
- standard deviation
- search space
- linear systems
- genetic algorithm
- shortest path
- linear programming relaxation
- combinatorial optimization
- np hard
- optimal path
- generalization error
- heuristic solution
- mixed integer
- sample complexity
- dynamic programming
- integer programming
- neural network
- simulated annealing