ISSN:
1436-4646
Keywords:
Generalized assignment problem
;
knapsack problem
;
special ordered sets
;
integer polytope
;
facets
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract Three classes of valid inequalities based upon multiple knapsack constraints are derived for the generalized assignment problem. General properties of the facet defining inequalities are discussed and, for a special case, the convex hull is completely characterized. In addition, we prove that a basic fractional solution to the linear programming relaxation can be eliminated by a facet defining inequality associated with an individual knapsack constraint.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01585725
Permalink