Approximating Connected Facility Location with Lower and Upper Bounds via LP Rounding.
Zachary FriggstadMohsen RezapourMohammad R. SalavatipourPublished in: SWAT (2016)
Keyphrases
- facility location
- lower and upper bounds
- mixed integer
- lagrangian relaxation
- linear programming
- valid inequalities
- lower bound
- linear programming relaxation
- linear program
- upper bound
- feasible solution
- optimal solution
- mixed integer programming
- upper and lower bounds
- integer programming
- lot sizing
- steiner tree
- optimal location
- cutting plane
- objective function
- column generation
- convex hull
- continuous variables
- approximation algorithms
- np hard
- network design
- search space
- cutting plane algorithm
- lagrangian dual
- neural network
- lp relaxation
- primal dual
- dynamic programming
- data mining