On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets.
D. Chinhyung ChoEllis L. JohnsonManfred PadbergM. R. RaoPublished in: Math. Oper. Res. (1983)
Keyphrases
- valid inequalities
- facet defining inequalities
- fixed charge
- network design problem
- facet defining
- integer programming
- traveling salesman problem
- mixed integer
- mixed integer programming
- linear programming
- convex hull
- feasible solution
- lot sizing
- lower and upper bounds
- column generation
- cutting plane algorithm
- cutting plane
- integer program
- mixed integer linear programs
- integer programming formulation
- primal dual
- integer programming problems
- lagrangian relaxation
- transportation problem
- optimal solution
- lp relaxation
- production planning
- np hard
- lower bound
- approximation algorithms
- knapsack problem
- upper bound
- special case