The generalized assignment problem: Valid inequalities and facets
- 1 January 1990
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 46 (1) , 31-52
- https://doi.org/10.1007/bf01585725
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- (1,k)-configuration facets for the generalized assignment problemMathematical Programming, 1990
- A Cutting Plane Algorithm for the Linear Ordering ProblemOperations Research, 1984
- On the Uncapacitated Plant Location Problem. II: Facets and Lifting TheoremsMathematics of Operations Research, 1983
- On the Uncapacitated Plant Location Problem. I: Valid Inequalities and FacetsMathematics of Operations Research, 1983
- Solving Large-Scale Zero-One Linear Programming ProblemsOperations Research, 1983
- Facets of the Knapsack Polytope From Minimal CoversSIAM Journal on Applied Mathematics, 1978
- Resource constrained scheduling as generalized bin packingJournal of Combinatorial Theory, Series A, 1976
- An Integer Generalized Transportation Model for Optimal Job Assignment in Computer NetworksOperations Research, 1976
- Facets of the knapsack polytopeMathematical Programming, 1975
- An all Zero-One Algorithm for a Certain Class of Transportation ProblemsOperations Research, 1971