{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,17]],"date-time":"2022-06-17T11:51:01Z","timestamp":1655466661216},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1987,6,1]],"date-time":"1987-06-01T00:00:00Z","timestamp":549504000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BIT"],"published-print":{"date-parts":[[1987,6]]},"DOI":"10.1007\/bf01934179","type":"journal-article","created":{"date-parts":[[2005,7,25]],"date-time":"2005-07-25T05:44:21Z","timestamp":1122270261000},"page":"148-156","source":"Crossref","is-referenced-by-count":2,"title":["Bin packing: On optimizing the number of pieces packed"],"prefix":"10.1007","volume":"27","author":[{"given":"Donald K.","family":"Friesen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael A.","family":"Langston","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01934179_CR1","doi-asserted-by":"crossref","unstructured":"E. G. Coffman Jr., M. R. Garey and D. S. Johnson,Approximation algorithms for bin packing \u2014 an updated survey, inAlgorithm Design for Computer Systems Design (G. Ausiello, M. Lucertini, P. Serafini, editors), Springer-Verlag (1984), 49\u2013106.","DOI":"10.1007\/978-3-7091-4338-4_3"},{"key":"BF01934179_CR2","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/BF00264618","volume":"21","author":"E. G. Coffman Jr.","year":"1984","unstructured":"E. G. Coffman Jr. and M. A. Langston,A performance guarantee for the greedy setpartitioning algorithm, Acta Informatica 21 (1984), 409\u2013415.","journal-title":"Acta Informatica"},{"key":"BF01934179_CR3","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1137\/0208016","volume":"8","author":"E. G. Coffman Jr.","year":"1979","unstructured":"E. G. Coffman Jr. and J. Y.-T. Leung,Combinatorial analysis of an efficient algorithm for processor and storage allocation, SIAM J. Comput. 8 (1979), 202\u2013217.","journal-title":"SIAM J. Comput."},{"key":"BF01934179_CR4","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF00288885","volume":"9","author":"E. G. Coffman Jr.","year":"1978","unstructured":"E. G. Coffman Jr., J. Y.-T. Leung and D. W. Ting,Bin packing: maximizing the number of pieces packed, Acta Informatica 9 (1978), 263\u2013271.","journal-title":"Acta Informatica"},{"key":"BF01934179_CR5","unstructured":"D. K. Friesen and F. S. Kuhl,Analysis of a hybrid algorithm for packing unequal-sized bins, SIAM J. Comput., to appear."},{"key":"BF01934179_CR6","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1137\/0215016","volume":"15","author":"D. K. Friesen","year":"1986","unstructured":"D. K. Friesen and M. A. Langston,Variable sized bin packing, SIAM J. Comput. 15 (1986), 222\u2013230.","journal-title":"SIAM J. Comput."},{"key":"BF01934179_CR7","unstructured":"id., Analysis of a compound bin-packing algorithm, to appear."},{"key":"BF01934179_CR8","unstructured":"M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Co. (1979)."},{"key":"BF01934179_CR9","unstructured":"E. Horowitz and S. Sahni,Fundamentals of Computer Algorithms, Computer Science Press (1979)."},{"key":"BF01934179_CR10","unstructured":"N. Karmarkar and R. M. Karp,The differencing method of set partitioning, to appear."},{"key":"BF01934179_CR11","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1137\/0605017","volume":"5","author":"M. A. Langston","year":"1984","unstructured":"M. A. Langston,Performance of heuristics for a computer resource allocation problem, SIAM J. Alg. Disc. Meth. 5 (1984), 154\u2013161.","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"BF01934179_CR12","unstructured":"id., A study of composite heuristic algorithms, J. Oper. Res. Soc., to appear."},{"key":"BF01934179_CR13","unstructured":"C. H. Papadimitriou and K. Steiglitz,Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall (1982)."}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01934179.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01934179\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01934179","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T10:01:07Z","timestamp":1586340067000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01934179"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,6]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,6]]}},"alternative-id":["BF01934179"],"URL":"https:\/\/doi.org\/10.1007\/bf01934179","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,6]]}}}