1. Akbar, M.M., Sadid, M.W.H., Rahman, M.S., Newton, M.A.H., Kaykobad, M.: A Parallel heuristic algorithm for multiple-choice multi-dimensional knapsack problem. Working paper, Department of CSE, BUET, Dhaka-1000, Bangladesh (2005)
2. Balas, E., Zemel, E.: An algorithm for large zero-one knapsack problem. Oper. Res. 28, 1130–1154 (1980)
3. Björklund, P., Värbrand, P., Yuan, D.: A column generation method for spatial TDMA scheduling in ad hoc networks. Working paper, Department of Science and Technology, Linköping Institute of Technology, Norrköping, Sweden. To appear in Ad Hoc Netw.
4. Fayard, D., Plateau, G.: An algorithm for the solution of the 0-1 knapsack problem. Computing 28, 269–287 (1982)
5. Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, New York (1979)