Hypergraphic LP Relaxations for Steiner Trees.

Deeparnab Chakrabarty Jochen Könemann David Pritchard

Published in: IPCO (2010)

Keyphrases

steiner tree
lp relaxation
linear programming relaxation
linear programming
knapsack problem
integer programming
linear program
integer program

facility location
feasible solution
valid inequalities
message passing
optimal solution
minimum spanning tree
energy minimization
shortest path

global constraints
mixed integer
column generation
maximum a posteriori
mixed integer programming
optimization problems
cutting plane

dynamic programming
np hard
lagrangian relaxation
traveling salesman problem
constraint satisfaction problems
distributed systems
higher order