Simplex based Steiner tree instances yield large integrality gaps for the bidirected cut relaxation.
Robert VicariPublished in: CoRR (2020)
Keyphrases
- linear programming relaxation
- steiner tree
- integrality gap
- linear programming
- knapsack problem
- lower bound
- feasible solution
- integer programming
- column generation
- branch and bound
- integer program
- mixed integer programming
- valid inequalities
- linear program
- cutting plane
- families of valid inequalities
- primal dual
- optimal solution
- tabu search
- upper bound
- convex hull
- optimization problems
- dynamic programming
- computational complexity
- objective function
- genetic algorithm