Valid inequalities and facets of the capacitated plant location problem.
Janny M. Y. LeungThomas L. MagnantiPublished in: Math. Program. (1989)
Keyphrases
- valid inequalities
- fixed charge
- network design problem
- facet defining inequalities
- facet defining
- integer programming
- traveling salesman problem
- mixed integer programming
- mixed integer
- linear programming
- lower and upper bounds
- lot sizing
- multi item
- feasible solution
- cutting plane algorithm
- column generation
- convex hull
- cutting plane
- linear programming relaxation
- mixed integer linear programs
- primal dual
- transportation problem
- np hard
- integer program
- network flow problem
- integer programming formulation
- lagrangian relaxation
- lower bound
- network design
- vehicle routing problem
- integer programming problems
- continuous variables
- upper bound
- optimal solution
- production planning
- combinatorial optimization
- linear program
- routing problem
- multistage
- optimization problems