{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:11:31Z","timestamp":1774415491984,"version":"3.50.1"},"reference-count":21,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,4,1]],"date-time":"2004-04-01T00:00:00Z","timestamp":1080777600000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2004,4]]},"DOI":"10.1016\/s0377-2217(02)00810-x","type":"journal-article","created":{"date-parts":[[2003,1,30]],"date-time":"2003-01-30T15:52:50Z","timestamp":1043941970000},"page":"36-45","source":"Crossref","is-referenced-by-count":14,"title":["Average performance of greedy heuristics for the integer knapsack problem"],"prefix":"10.1016","volume":"154","author":[{"given":"Rajeev","family":"Kohli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ramesh","family":"Krishnamurti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prakash","family":"Mirchandani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0377-2217(02)00810-X_BIB1","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/S0377-2217(99)00265-9","article-title":"Unbounded knapsack problem: Dynamic programming revisited","volume":"123","author":"Andonov","year":"2000","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00810-X_BIB2","doi-asserted-by":"crossref","unstructured":"J. Bentley, D.S. Johnson, F.T. Leighton, C.C. McGeoch, Some unexpected expected behavior results for bin packing, Proceedings of the 16th ACM Symposium on the Theory of Computing, 1984, pp. 279\u2013288","DOI":"10.1145\/800057.808692"},{"key":"10.1016\/S0377-2217(02)00810-X_BIB3","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1080\/15326348508807011","article-title":"A probabilistic analysis of multiprocessing list scheduling: The Erlang case","volume":"1","author":"Boxma","year":"1985","journal-title":"Stochastic Models"},{"key":"10.1016\/S0377-2217(02)00810-X_BIB4","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/BF00265685","article-title":"Probabilistic bounds for dual bin packing","volume":"22","author":"Bruno","year":"1985","journal-title":"Acta Informatica"},{"key":"10.1016\/S0377-2217(02)00810-X_BIB5","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0167-5060(08)70827-6","article-title":"Travelling salesman and assignment problems: A survey","volume":"4","author":"Burkard","year":"1979","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0377-2217(02)00810-X_BIB6","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/S0019-9958(80)90050-9","article-title":"A stochastic model of bin-packing","volume":"44","author":"Coffman","year":"1980","journal-title":"Information and Control"},{"issue":"3","key":"10.1016\/S0377-2217(02)00810-X_BIB7","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1287\/mnsc.34.3.266","article-title":"Asymptotic methods in the probabilistic analysis of sequencing and packing heuristics","volume":"34","author":"Coffman","year":"1988","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(02)00810-X_BIB8","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0167-6377(86)90013-1","article-title":"A probabilistic analysis of the next fit decreasing bin packing heuristic","volume":"5","author":"Csirik","year":"1986","journal-title":"Operations Research Letters"},{"issue":"1","key":"10.1016\/S0377-2217(02)00810-X_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.26.1.1","article-title":"Worst-case analysis of heuristic algorithms","volume":"26","author":"Fisher","year":"1980","journal-title":"Management Science"},{"issue":"1","key":"10.1016\/S0377-2217(02)00810-X_BIB10","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1287\/moor.5.1.27","article-title":"Probabilistic analysis of the planar K-median problem","volume":"5","author":"Fisher","year":"1980","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(02)00810-X_BIB11","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0166-218X(83)90017-3","article-title":"Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem","volume":"5","author":"Franco","year":"1983","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"10.1016\/S0377-2217(02)00810-X_BIB12","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1287\/moor.10.1.100","article-title":"Asymptotic properties of the quadratic assignment problem","volume":"10","author":"Frenk","year":"1985","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"10.1016\/S0377-2217(02)00810-X_BIB13","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1287\/moor.2.3.209","article-title":"Probabilistic analysis of partitioning algorithms for the travelling-salesman problem in the plane","volume":"2","author":"Karp","year":"1977","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(02)00810-X_BIB14","doi-asserted-by":"crossref","unstructured":"R.M. Karp, M. Luby, A. Marchetti-Spaccamela, A probabilistic analysis of multidimensional bin packing problems, Proceedings of the 16th ACM Symposium of the Theory of Computing 1984, pp. 289\u2013298","DOI":"10.1145\/800057.808693"},{"issue":"4","key":"10.1016\/S0377-2217(02)00810-X_BIB15","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1137\/0402046","article-title":"Average performance of heuristics for satisfiability","volume":"2","author":"Kohli","year":"1989","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"2","key":"10.1016\/S0377-2217(02)00810-X_BIB16","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0167-6377(92)90065-B","article-title":"A total-value greedy heuristic for the integer knapsack problem","volume":"12","author":"Kohli","year":"1992","journal-title":"Operations Research Letters"},{"issue":"2","key":"10.1016\/S0377-2217(02)00810-X_BIB17","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1137\/S0895480191220836","article-title":"The minimum satisfiability problem","volume":"7","author":"Kohli","year":"1994","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"10.1016\/S0377-2217(02)00810-X_BIB18","series-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"Martello","year":"1990"},{"issue":"2","key":"10.1016\/S0377-2217(02)00810-X_BIB19","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/S0377-2217(99)00260-X","article-title":"New trends in exact algorithms for the 0\u20131 knapsack problem","volume":"123","author":"Martello","year":"2000","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00810-X_BIB20","doi-asserted-by":"crossref","unstructured":"D. Pisinger, P. Toth, Knapsack problems, in: D.-Z. Du, P. Pardalos, (Eds.), Handbook of Combinatorial Optimization, vol. 1, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1998, pp. 299\u2013428","DOI":"10.1007\/978-1-4613-0303-9_5"},{"issue":"2","key":"10.1016\/S0377-2217(02)00810-X_BIB21","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF02579171","article-title":"The average-case analysis of some on-line algorithms for bin packing","volume":"6","author":"Shor","year":"1986","journal-title":"Combinatorica"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722170200810X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722170200810X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T06:56:57Z","timestamp":1553929017000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S037722170200810X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,4]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,4]]}},"alternative-id":["S037722170200810X"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00810-x","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2004,4]]}}}