A set partitioning heuristic for the generalized assignment problem
- 1 January 1994
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 72 (1) , 167-174
- https://doi.org/10.1016/0377-2217(94)90338-7
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- A survey of algorithms for the generalized assignment problemEuropean Journal of Operational Research, 1992
- On the integer properties of scheduling set partitioning modelsEuropean Journal of Operational Research, 1988
- A new Lagrangian relaxation approach to the generalized assignment problemEuropean Journal of Operational Research, 1986
- A property of assignment type mixed integer linear programming problemsOperations Research Letters, 1983
- An algorithm for the solution of the 0–1 knapsack problemComputing, 1982
- The Computation of Shadow Prices in Linear ProgrammingJournal of the Operational Research Society, 1982
- A generalized assignment heuristic for vehicle routingNetworks, 1981
- An effective subgradient algorithm for the generalized assignment problemComputers & Operations Research, 1979
- A branch and bound algorithm for the generalized assignment problemMathematical Programming, 1975
- Lagrangean relaxation for integer programmingPublished by Springer Nature ,1974