Lower Bounds on the Integraliy Ratio of the Subtour LP for the Traveling Salesman Problem.
Xianghui ZhongPublished in: CoRR (2021)
Keyphrases
- traveling salesman problem
- lower bound
- subtour elimination
- lp relaxation
- valid inequalities
- optimal solution
- objective function
- upper bound
- combinatorial optimization
- np hard
- linear programming
- linear programming relaxation
- optimization problems
- linear program
- branch and bound algorithm
- ant colony optimization
- combinatorial problems
- branch and bound
- combinatorial optimization problems
- ant colony optimization algorithm
- feasible solution
- hamiltonian cycle
- metaheuristic
- crossover operator
- traveling salesman
- lower and upper bounds
- discrete particle swarm optimization
- message passing
- integer programming
- max sat
- lagrangian relaxation
- cost function
- multi objective
- discrete optimization problems
- evolutionary algorithm
- genetic local search
- cutting plane
- knapsack problem