Efficient Algorithms for Solving Hypergraphic Steiner Tree Relaxations in Quasi-Bipartite Instances
Isaac FungKonstantinos GeorgiouJochen KönemannMalcolm SharpePublished in: CoRR (2012)
Keyphrases
- steiner tree
- linear programming relaxation
- efficient algorithms for solving
- lower bound
- linear programming
- upper bound
- branch and bound
- lower and upper bounds
- least squares
- knapsack problem
- column generation
- integer programming
- branch and bound algorithm
- bipartite graph
- np hard
- objective function
- feasible solution
- minimum spanning tree
- mixed integer programming
- valid inequalities
- facility location
- shortest path
- random walk