{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T18:07:45Z","timestamp":1776881265380,"version":"3.51.2"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,12,21]],"date-time":"2006-12-21T00:00:00Z","timestamp":1166659200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2007,2,8]]},"DOI":"10.1007\/s10479-006-0150-4","type":"journal-article","created":{"date-parts":[[2006,12,20]],"date-time":"2006-12-20T12:48:29Z","timestamp":1166618909000},"page":"17-29","source":"Crossref","is-referenced-by-count":98,"title":["Greedy algorithm for the general multidimensional knapsack problem"],"prefix":"10.1007","volume":"150","author":[{"given":"Yal\u00e7\u0131n","family":"Ak\u00e7ay","sequence":"first","affiliation":[]},{"given":"Haijun","family":"Li","sequence":"additional","affiliation":[]},{"given":"Susan H.","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,12,21]]},"reference":[{"key":"150_CR1","doi-asserted-by":"crossref","unstructured":"Akcay, Y. and S.H. Xu. (2004). \u201cJoint Inventory Replenishment and Component Allocation Optimization in An Assemble-to-Order System.\u201d Management Science, 50(1), 99\u2013116.","DOI":"10.1287\/mnsc.1030.0167"},{"key":"150_CR2","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/S0377-2217(99)00261-1","volume":"123","author":"A. Caprara","year":"2000","unstructured":"Caprara, A., H. Kellerer, U. Pferschy, and D. Pisinger. (2000). \u201cApproximation Algorithms for Knapsack Problems with Cardinality Constraints.\u201d European Journal of Operational Research, 123, 333\u2013345.","journal-title":"European Journal of Operational Research"},{"key":"150_CR3","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1009642405419","volume":"4","author":"P.C. Chu","year":"1998","unstructured":"Chu, P.C. and J.E. Beasley. (1998). \u201cA Genetic Algorithm for the Multidimensional Knapsack Problem.\u201d Journal of Heuristics, 4, 63\u201386.","journal-title":"Journal of Heuristics"},{"key":"150_CR4","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1287\/ijoc.15.3.284.16077","volume":"15","author":"S. de Vries","year":"2003","unstructured":"de Vries, S. and R.V. Vohra. (2003). \u201cCombinatorial Auctions: A Survey.\u201d INFORMS Journal on Computing, 15, 284\u2013310.","journal-title":"INFORMS Journal on Computing"},{"key":"150_CR5","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1287\/opre.11.3.399","volume":"2","author":"H. Everett","year":"1963","unstructured":"Everett, H. (1963). \u201cGeneralized Langrange Multiplier Method for Solving Problems of Optimum Allocation of Resources.\u201d Operations Research, 2, 399\u2013417.","journal-title":"Operations Research"},{"key":"150_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(03)00274-1","volume":"155","author":"A. Freville","year":"2004","unstructured":"Freville, A. (2004). \u201cThe Multidimensional 0-1 Knapsack Problem: An Overview.\u201d European Journal of Operational Research, 155, 1\u201321.","journal-title":"European Journal of Operational Research"},{"key":"150_CR7","unstructured":"Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: W. H. Freeman."},{"key":"150_CR8","doi-asserted-by":"crossref","unstructured":"Kellerer, H., U. Pferschy, and D. Pisinger. (2004). Knapsack Problems. Springer.","DOI":"10.1007\/978-3-540-24777-7"},{"key":"150_CR9","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1287\/opre.49.1.26.11185","volume":"49","author":"A. Kleywegt","year":"2001","unstructured":"Kleywegt, A. and J.D. Papastavrou. (2001). \u201cThe dynamic and Stochastic Knapsack Problem with Random Sized Items.\u201d Operations Research, 49, 26\u201341.","journal-title":"Operations Research"},{"key":"150_CR10","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1111\/j.1540-5915.1974.tb00593.x","volume":"5","author":"G.A. Kochenberger","year":"1974","unstructured":"Kochenberger, G.A., B.A. McCarl, and F.P. Wyman. (1974). \u201cA Heuristic for General Integer Programming.\u201d Decision Sciences, 5, 36\u201344.","journal-title":"Decision Sciences"},{"key":"150_CR11","doi-asserted-by":"crossref","unstructured":"Lin, E.Y.-H. (1998). \u201cA Bibliographical Survey on Some Well-Known Non-Standard Knapsack Problems.\u201d INFOR, 36(4), 274\u2013317.","DOI":"10.1080\/03155986.1998.11732364"},{"key":"150_CR12","doi-asserted-by":"crossref","first-page":"1101","DOI":"10.1287\/opre.27.6.1101","volume":"27","author":"R. Loulou","year":"1979","unstructured":"Loulou, R. and E. Michaelides. (1979). \u201cNew Greedy-like Heuristics for the Multidimensional 0-1 Knapsack Problem.\u201d Operations Research, 27, 1101\u20131114.","journal-title":"Operations Research"},{"key":"150_CR13","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1057\/palgrave.jors.2600721","volume":"50","author":"L.L. Lu","year":"1999","unstructured":"Lu, L.L., S.Y. Chiu, and L.A. Cox. (1999). \u201cOptimal Project Selection: Stochastic Knapsack with Finite Time Horizon.\u201d Operations Research, 50, 645\u2013650.","journal-title":"Operations Research"},{"key":"150_CR14","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0377-2217(84)90286-8","volume":"16","author":"M.J. Magazine","year":"1984","unstructured":"Magazine, M.J. and O. Oguz. (1984). \u201cA Heuristic Algorithm for the Multidimensional Zero-One Knapsack Problem.\u201d European Journal of Operational Research, 16, 319\u2013326.","journal-title":"European Journal of Operational Research"},{"key":"150_CR15","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1287\/mnsc.13.9.736","volume":"13","author":"C.C. Petersen","year":"1967","unstructured":"Petersen, C.C. (1967). \u201cComputational Experience with Variants of the Balas Algorithm Applied to the Selection of R&D Projects.\u201d Management Science, 13, 736\u2013750.","journal-title":"Management Science"},{"key":"150_CR16","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1002\/1520-6750(198704)34:2<161::AID-NAV3220340203>3.0.CO;2-A","volume":"34","author":"H. Pirkul","year":"1987","unstructured":"Pirkul, H. (1987). \u201cA Heuristic Solution Procedure for the Multiconstraint Zero-One Knapsack Problem.\u201d Naval Research Logistics, 34, 161\u2013172.","journal-title":"Naval Research Logistics"},{"key":"150_CR17","doi-asserted-by":"crossref","unstructured":"Pirkul, H. and S. Narasimhan. (1986). \u201cEfficient Algorithms for the Multiconstraint General Knapsack Problem.\u201d IIE Transactions, pp. 195\u2013203.","DOI":"10.1080\/07408178608975347"},{"key":"150_CR18","doi-asserted-by":"crossref","unstructured":"Senju, S. and Y. Toyoda. (1968). \u201cAn Approach to Linear Programming with 0-1 Variables.\u201d Management Science, 15(4), B196\u2013B207.","DOI":"10.1287\/mnsc.15.4.B196"},{"key":"150_CR19","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1057\/jors.1979.78","volume":"30","author":"W. Shih","year":"1979","unstructured":"Shih, W. (1979). \u201cA Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem.\u201d Journal of Operational Research Society, 30, 369\u2013378.","journal-title":"Journal of Operational Research Society"},{"key":"150_CR20","doi-asserted-by":"crossref","unstructured":"Toyoda, Y. (1975). \u201cA Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems.\u201d Management Science, 21(12), 1417\u20131427.","DOI":"10.1287\/mnsc.21.12.1417"},{"key":"150_CR21","doi-asserted-by":"crossref","first-page":"963","DOI":"10.1057\/jors.1990.148","volume":"41","author":"A. Volgenant","year":"1990","unstructured":"Volgenant, A. and J.A. Zoon. (1990). \u201cAn Improved Heuristic for Multidimensional 0-1 Knapsack Problems.\u201d Journal of Operational Research Society, 41, 963\u2013970.","journal-title":"Journal of Operational Research Society"},{"key":"150_CR22","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1287\/opre.15.1.83","volume":"15","author":"H.M. Weingartner","year":"1967","unstructured":"Weingartner, H.M. and D.N. Ness. (1967). \u201cMethods for the Solution of the Multi-Dimensional 0\/1 Knapsack Problem.\u201d Operations Research, 15, 83\u2013103.","journal-title":"Operations Research"},{"key":"150_CR23","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1287\/mnsc.24.1.91","volume":"24","author":"S.H. Zanakis","year":"1977","unstructured":"Zanakis, S.H. (1977). \u201cHeuristic 0-1 Linear Programming: Comparisons of Three Methods.\u201d Management Science, 24, 91\u2013103.","journal-title":"Management Science"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-006-0150-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-006-0150-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-006-0150-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:07:37Z","timestamp":1559138857000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-006-0150-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12,21]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,2,8]]}},"alternative-id":["150"],"URL":"https:\/\/doi.org\/10.1007\/s10479-006-0150-4","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12,21]]}}}