Matroids and Integrality Gaps for Hypergraphic Steiner Tree Relaxations
Michel X. GoemansNeil OlverThomas RothvoßRico ZenklusenPublished in: CoRR (2011)
Keyphrases
- steiner tree
- linear programming relaxation
- knapsack problem
- linear programming
- lower bound
- mixed integer programming
- integer programming
- feasible solution
- column generation
- branch and bound
- integer program
- valid inequalities
- submodular functions
- mixed integer
- optimization problems
- cutting plane
- upper bound
- dynamic systems
- linear program
- network flow
- lp relaxation
- dynamic programming