References
- Dantzig , G. B. 1957 . Discrete variable extremum problems . Oper. Res , 5 : 266 – 277 .
- Dembo , R. S. and Hammer , P. L. 1980 . A reduction algorithm for knapsack problems . Methods Oper. Res , 36 : 49 – 60 .
- Fisher , M. 1981 . The Lagrangian relaxation method for solving integer programming problems . Manag. Sci , 27 : 1 – 18 .
- Garey , M. R. and Johnson , D. S. 1979 . Computers and Intractability: A Guide to the Theory of NP-Completeness , San Francisco, CA : Freeman and Company .
- Horowitz , E. and Sahni , S. 1974 . Computing partitions with application to the knapsack problem . J. ACM , 21 : 277 – 292 .
- CPLEX Ver. 11.0, ILOG, 2008. Available at http://www.ilog.com/products/cplex/
- Ingargiola , G. P. and Korsh , F. F. 1973 . Reduction algorithms for zero-one single knapsack problems . Manag. Sci , 20 : 460 – 463 .
- Kellerer , H. , Pferschy , U. and Pisinger , D. 2004 . Knapsack Problems , Berlin : Springer .
- Martello , S. and Toth , P. 1990 . “ Knapsack Problems: Algorithms and Computer Implementations ” . In John Wiley & Sons Chichester
- Pisinger , D. 1995 . An expanding-core algorithm for the exact 0-1 knapsack problem . European J. Oper. Res , 87 : 175 – 187 .
- Pisinger , D. 1999 . An exact algorithm for large multiple knapsack problems . European J. Oper. Res , 114 : 528 – 541 .
- Sedgewick , R. 1997 . “ Algorithm in C ” . In , 3 , USA : Addison-Wesley Professional .
- Wolsey , L. 1998 . “ Integer Programming ” . New York : John Wiley & Sons .
- Yasuda , R. 2005 . An algorithm for the fixed-charge multiple knapsack problem . (in Japanese), unpublished MS thesis, National Defense Academy
- Yasuda , R. 2005 . An algorithm for the fixed-charge multiple knapsack problem . (in Japanese), unpublished MS thesis, National Defense Academy
- You , B.-J. and Yamada , T. 2010 . An exact algorithm for the budget-constrained multiple knapsack problem . RIMS Kokyuroku 1682 (Decision Making Problems under Uncertainty) , : 168 – 175 .