A family of inequalities for the generalized assignment polytope.
Ismael R. de Farias Jr.George L. NemhauserPublished in: Oper. Res. Lett. (2001)
Keyphrases
- facet defining inequalities
- facet defining
- valid inequalities
- mixed integer
- integer programming problems
- special case
- linear programming
- sufficient conditions
- convex hull
- lattice points
- computational complexity
- scheduling problem
- feasible solution
- integer programming
- continuous variables
- mixed integer linear programs