An exact algorithm for the fixed-charge multiple knapsack problem
Authors:
- Takeo YamadaTYTakeo Yamada
- Takahiro TakeokaTTTakahiro Takeoka
- 1 January 2009
- journal article
- research article
- Published by Elsevier in European Journal of Operational Research
- Vol. 192 (2) , 700-705
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- An exact algorithm for large multiple knapsack problemsEuropean Journal of Operational Research, 1999
- An expanding-core algorithm for the exact 0–1 knapsack problemEuropean Journal of Operational Research, 1995
- The Lagrangian Relaxation Method for Solving Integer Programming ProblemsManagement Science, 1981