Abstract
class of facet defining inequalities for the generalized assignment problem is derived. These inequalities are based upon multiple knapsack constraints and are derived from (1,k)-configuration inequalities.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Edmonds and D.R. Fulkerson, “Bottleneck extrema,”Journal of Combinatorial Theory 8 (1970) 299–306.
E.S. Gottlieb, “Contributions to the polyhedral approach to generalized assignment problems,” Ph.D. Thesis, Graduate School of Business Administration, New York University (New York, 1985).
E.S. Gottlieb and M.R. Rao, “The generalized assignment problem: valid inequalities and facets,”Mathematical Programming 46 (1990) 31–52, this issue.
E.S. Gottlieb and M.R. Rao, “The generalized assignment problem II: three classes of facets,” Technical Report #8622-Stat, Baruch College, The City University of New York (New York, 1986).
M.W. Padberg, “A note on zero-one programming,”Operations Research 23 (1975) 833–837.
Author information
Authors and Affiliations
Additional information
Partial financial support under NSF grant #CCR-8812736.
Partial financial support under NSF grant #DMS-8606188.
Rights and permissions
About this article
Cite this article
Gottlieb, E.S., Rao, M.R. (1,k)-configuration facets for the generalized assignment problem. Mathematical Programming 46, 53–60 (1990). https://doi.org/10.1007/BF01585726
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01585726