{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T16:19:05Z","timestamp":1774023545166,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,5,28]],"date-time":"2008-05-28T00:00:00Z","timestamp":1211932800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2010,5]]},"DOI":"10.1007\/s10589-008-9184-7","type":"journal-article","created":{"date-parts":[[2008,5,27]],"date-time":"2008-05-27T13:22:01Z","timestamp":1211894521000},"page":"51-73","source":"Crossref","is-referenced-by-count":42,"title":["A column generation method for the multiple-choice multi-dimensional knapsack problem"],"prefix":"10.1007","volume":"46","author":[{"given":"N.","family":"Cherfi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Hifi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,5,28]]},"reference":[{"key":"9184_CR1","unstructured":"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)"},{"key":"9184_CR2","doi-asserted-by":"crossref","first-page":"1130","DOI":"10.1287\/opre.28.5.1130","volume":"28","author":"E. Balas","year":"1980","unstructured":"Balas, E., Zemel, E.: An algorithm for large zero-one knapsack problem. Oper. Res. 28, 1130\u20131154 (1980)","journal-title":"Oper. Res."},{"key":"9184_CR3","unstructured":"Bj\u00f6rklund, P., V\u00e4rbrand, P., Yuan, D.: A column generation method for spatial TDMA scheduling in ad hoc networks. Working paper, Department of Science and Technology, Link\u00f6ping Institute of Technology, Norrk\u00f6ping, Sweden. To appear in Ad Hoc Netw."},{"key":"9184_CR4","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF02241754","volume":"28","author":"D. Fayard","year":"1982","unstructured":"Fayard, D., Plateau, G.: An algorithm for the solution of the 0-1 knapsack problem. Computing 28, 269\u2013287 (1982)","journal-title":"Computing"},{"key":"9184_CR5","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, New York (1979)"},{"key":"9184_CR6","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"P.C. Gilmore","year":"1961","unstructured":"Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting stock problem. Oper. Res. 9, 849\u2013859 (1961)","journal-title":"Oper. Res."},{"key":"9184_CR7","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1057\/jors.1963.12","volume":"14","author":"P.C. Gilmore","year":"1963","unstructured":"Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting stock problem, part II. Oper. Res. 14, 94\u2013120 (1963)","journal-title":"Oper. Res."},{"key":"9184_CR8","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/s10589-005-3057-0","volume":"33","author":"M. Hifi","year":"2006","unstructured":"Hifi, M., Michrafy, M., Sbihi, A.: A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem. Comput. Optim. Appl. 33, 271\u2013285 (2006)","journal-title":"Comput. Optim. Appl."},{"key":"9184_CR9","doi-asserted-by":"crossref","first-page":"1323","DOI":"10.1057\/palgrave.jors.2601796","volume":"55","author":"M. Hifi","year":"2004","unstructured":"Hifi, M., Michrafy, M., Sbihi, A.: Heuristic algorithms for the multiple-choice multidimensional knapsack problem. J. Oper. Res. Soc. 55, 1323\u20131332 (2004)","journal-title":"J. Oper. Res. Soc."},{"key":"9184_CR10","isbn-type":"print","volume-title":"Knapsack Problems","author":"H. Kellerer","year":"2005","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin (2005). ISBN 3-540-40286-1","ISBN":"https:\/\/id.crossref.org\/isbn\/3540402861"},{"key":"9184_CR11","unstructured":"Khan, S.: Quality adaptation in a multi-session adaptive multimedia system: model and architecture. Ph.D. thesis, Department of Electronics and Computer Engineering, University of Victoria (1998)"},{"key":"9184_CR12","first-page":"154","volume":"2","author":"S. Khan","year":"2002","unstructured":"Khan, S., Li, K.F., Manning, E.G., Akbar, MD.M.: Solving the knapsack problem for adaptive multimedia systems. Int. J. Studia Inf. 2, 154\u2013174 (2002). Special Issue on Cutting, Packing and Knapsacking Problems","journal-title":"Int. J. Studia Inf."},{"key":"9184_CR13","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1287\/ijoc.8.4.344","volume":"8","author":"A. Mehrotra","year":"1996","unstructured":"Mehrotra, A., Trick, M.A.: A column generation approach for graph coloring. INFORMS J. Comput. 8, 344\u2013354 (1996)","journal-title":"INFORMS J. Comput."},{"key":"9184_CR14","first-page":"582","volume":"80","author":"M. Moser","year":"1997","unstructured":"Moser, M., Jokanovi\u0107, D.P., Shiratori, N.: An algorithm for the multidimensional multiple-choice knapsack problem. IEECE Trans. Fundam. Electron. 80, 582\u2013589 (1997)","journal-title":"IEECE Trans. Fundam. Electron."},{"key":"9184_CR15","doi-asserted-by":"crossref","first-page":"1417","DOI":"10.1287\/mnsc.21.12.1417","volume":"21","author":"Y. Toyoda","year":"1975","unstructured":"Toyoda, Y.: A simplified algorithm for obtaining approximate solution to zero-one programming problems. Manag. Sci. 21, 1417\u20131427 (1975)","journal-title":"Manag. Sci."},{"key":"9184_CR16","volume-title":"Integer Programming","author":"L.A. Wolsey","year":"1998","unstructured":"Wolsey, L.A.: Integer Programming. Wiley-Interscience, New York (1998)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-008-9184-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-008-9184-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-008-9184-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:36:35Z","timestamp":1559302595000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-008-9184-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,28]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,5]]}},"alternative-id":["9184"],"URL":"https:\/\/doi.org\/10.1007\/s10589-008-9184-7","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,5,28]]}}}