{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T09:01:15Z","timestamp":1773910875008,"version":"3.50.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0167-6377(02)00222-5","type":"journal-article","created":{"date-parts":[[2003,3,26]],"date-time":"2003-03-26T00:16:29Z","timestamp":1048637789000},"page":"202-210","source":"Crossref","is-referenced-by-count":17,"title":["Average-case analysis of a greedy algorithm for the 0\/1 knapsack problem"],"prefix":"10.1016","volume":"31","author":[{"given":"James M.","family":"Calvin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph Y.-T.","family":"Leung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(02)00222-5_BIB1","series-title":"Convergence of Probability Measures","author":"Billingsley","year":"1968"},{"key":"10.1016\/S0167-6377(02)00222-5_BIB2","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1287\/moor.14.1.162","article-title":"Probabilistic analysis of the multidimensional knapsack problem","volume":"14","author":"Dyer","year":"1989","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0167-6377(02)00222-5_BIB3","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0167-6377(02)00222-5_BIB4","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF01586944","article-title":"On rate of convergence and asymptotic normality in the multiknapsack problem","volume":"51","author":"van de Geer","year":"1993","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(02)00222-5_BIB5","doi-asserted-by":"crossref","unstructured":"A.V. Goldberg, A. Marchetti-Spaccamela, On finding the exact solution of a zero\u2013one knapsack problem, in: Proceedings of the XVI STOC, 1984, pp. 359\u2013368.","DOI":"10.1145\/800057.808701"},{"key":"10.1016\/S0167-6377(02)00222-5_BIB6","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/321906.321909","article-title":"Fast approximation algorithms for the knapsack and sum of subset problems","volume":"22","author":"Ibarra","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0167-6377(02)00222-5_BIB7","series-title":"A First Course in Stochastic Processes","author":"Karlin","year":"1975"},{"key":"10.1016\/S0167-6377(02)00222-5_BIB8","doi-asserted-by":"crossref","unstructured":"G.S. Lueker, On the average difference between the solutions to linear and integer knapsack problems, in: R.L. Disey, T.J. Offa (Eds.), Applied Probability\u2014Computer Science: The Interface, Vol. I, Birkhauser, Boston, 1982, pp. 489\u2013504.","DOI":"10.1007\/978-1-4612-5791-2_22"},{"key":"10.1016\/S0167-6377(02)00222-5_BIB9","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1006\/jagm.1998.0954","article-title":"Average-case analysis of off-line and on-line knapsack problems","volume":"29","author":"Lueker","year":"1998","journal-title":"J. Algorithms"},{"key":"10.1016\/S0167-6377(02)00222-5_BIB10","doi-asserted-by":"crossref","unstructured":"A. Marchetti-Spaccamela, C. Vercellis, Efficient on-line algorithms for the knapsack problem, in: Proceedings of the XIV ICALP, Lecture Notes in Computer Science, Vol. 267, Springer, Berlin, 1987, pp. 445\u2013456.","DOI":"10.1007\/3-540-18088-5_38"},{"key":"10.1016\/S0167-6377(02)00222-5_BIB11","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF01585741","article-title":"A probabilistic analysis of the multiknapsack value function","volume":"46","author":"Meanti","year":"1990","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(02)00222-5_BIB12","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1145\/321864.321873","article-title":"Approximate algorithms for the 0\/1 knapsack problem","volume":"22","author":"Sahni","year":"1975","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637702002225?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637702002225?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T08:04:06Z","timestamp":1584000246000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637702002225"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0167637702002225"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(02)00222-5","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}