Hypergraphic LP Relaxations for Steiner Trees
Deeparnab ChakrabartyJochen KönemannDavid PritchardPublished in: CoRR (2009)
Keyphrases
- steiner tree
- lp relaxation
- linear programming relaxation
- linear programming
- integer programming
- facility location
- integer program
- knapsack problem
- linear program
- message passing
- feasible solution
- valid inequalities
- optimal solution
- minimum spanning tree
- energy minimization
- shortest path
- global constraints
- np hard
- lagrangian relaxation
- cutting plane
- tabu search
- graph cuts
- production planning
- np complete
- special case
- dynamic programming
- constraint satisfaction problems
- metaheuristic
- traveling salesman problem
- convex hull
- belief propagation