We present a family of inequalities that are valid for the generalized assignment polytope. Although the inequalities are not facet-defining in general, they define facets of a polytope of a relaxation. We report computational results on the use of the inequalities in a branch-and-cut scheme that demonstrate their effectiveness.
|Number of pages||7|
|Journal||Operations Research Letters|
|State||Published - Sep 2001|
- Generalized assignment
- Integer programming