A hybrid algorithm for the generalized assignment problem
- 1 January 1991
- journal article
- Published by Taylor & Francis in Optimization
- Vol. 22 (2) , 273-282
- https://doi.org/10.1080/02331939108843666
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A Multiplier Adjustment Method for the Generalized Assignment ProblemManagement Science, 1986
- The Design of the XMP Linear Programming LibraryACM Transactions on Mathematical Software, 1981
- A generalized assignment heuristic for vehicle routingNetworks, 1981
- Pivot and Complement–A Heuristic for 0-1 ProgrammingManagement Science, 1980
- Note—On the Maximal Covering Location Problem and the Generalized Assignment ProblemManagement Science, 1979
- Facets of the Knapsack Polytope From Minimal CoversSIAM Journal on Applied Mathematics, 1978
- An Integer Generalized Transportation Model for Optimal Job Assignment in Computer NetworksOperations Research, 1976
- Facets of the knapsack polytopeMathematical Programming, 1975
- A tree-search algorithm for mixed integer programming problemsThe Computer Journal, 1965
- An Automatic Method of Solving Discrete Programming ProblemsEconometrica, 1960