{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T09:24:40Z","timestamp":1784193880211,"version":"3.55.0"},"reference-count":10,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"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":[[2003,9]]},"DOI":"10.1016\/s0377-2217(02)00466-6","type":"journal-article","created":{"date-parts":[[2003,1,30]],"date-time":"2003-01-30T20:45:15Z","timestamp":1043959515000},"page":"490-498","source":"Crossref","is-referenced-by-count":30,"title":["Upper bounds and algorithms for the maximum cardinality bin packing problem"],"prefix":"10.1016","volume":"149","author":[{"given":"Martine","family":"Labb\u00e9","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gilbert","family":"Laporte","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Silvano","family":"Martello","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00466-6_BIB1","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)00466-6_BIB2","first-page":"213","article-title":"A PTAS for the multiple knapsack problem","author":"Chekuri","year":"2000","journal-title":"Proceedings of SODA\u20192000"},{"key":"10.1016\/S0377-2217(02)00466-6_BIB3","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1137\/0208016","article-title":"Combinatorial analysis of an efficient algorithm for processor and storage allocation","volume":"8","author":"Coffman","year":"1979","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0377-2217(02)00466-6_BIB4","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF00288885","article-title":"Bin packing: Maximizing the number of pieces packed","volume":"9","author":"Coffman","year":"1978","journal-title":"Acta Informatica"},{"key":"10.1016\/S0377-2217(02)00466-6_BIB5","doi-asserted-by":"crossref","first-page":"858","DOI":"10.1137\/S1052623493254455","article-title":"Solving multiple knapsack problems by cutting planes","volume":"6","author":"Ferreira","year":"1996","journal-title":"SIAM Journal on Optimization"},{"key":"10.1016\/S0377-2217(02)00466-6_BIB6","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0020-0190(89)90088-4","article-title":"Probabilistic analysis for heuristics for the dual bin packing problem","volume":"31","author":"Foster","year":"1989","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0377-2217(02)00466-6_BIB7","first-page":"51","article-title":"A polynomial time approximation scheme for the multiple knapsack problem","author":"Kellerer","year":"1999","journal-title":"RANDOM\u2013\u2013APPROX\u201999"},{"key":"10.1016\/S0377-2217(02)00466-6_BIB8","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0167-6377(94)00060-J","article-title":"An exact algorithm for the dual bin packing problem","volume":"17","author":"Labb\u00e9","year":"1995","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(02)00466-6_BIB9","series-title":"Knapsack Problems","author":"Martello","year":"1990"},{"key":"10.1016\/S0377-2217(02)00466-6_BIB10","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0166-218X(90)90094-S","article-title":"Lower bounds and reduction procedures for the bin packing problem","volume":"28","author":"Martello","year":"1990","journal-title":"Discrete Applied Mathematics"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702004666?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702004666?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T03:59:08Z","timestamp":1553918348000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702004666"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0377221702004666"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00466-6","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}