{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T16:01:32Z","timestamp":1772121692366,"version":"3.50.1"},"reference-count":11,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1974,6,1]],"date-time":"1974-06-01T00:00:00Z","timestamp":139276800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":14291,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1974,6]]},"DOI":"10.1016\/s0022-0000(74)80026-7","type":"journal-article","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T09:46:40Z","timestamp":1289382400000},"page":"272-314","source":"Crossref","is-referenced-by-count":407,"title":["Fast algorithms for bin packing"],"prefix":"10.1016","volume":"8","author":[{"given":"David S.","family":"Johnson","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(74)80026-7_bib1","first-page":"1259","article-title":"An algorithm for the organization of information","volume":"3","author":"Adel'son-Vel'skii","year":"1962","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/S0022-0000(74)80026-7_bib2","author":"Brown","year":"1971"},{"key":"10.1016\/S0022-0000(74)80026-7_bib3","series-title":"Proceedings of the 3rd Annual ACM Symposium on the Theory of Computing","article-title":"The Complexity of Theorem-Proving Procedures","author":"Cook","year":"1971"},{"key":"10.1016\/S0022-0000(74)80026-7_bib4","unstructured":"A. Demers, private communication."},{"key":"10.1016\/S0022-0000(74)80026-7_bib5","series-title":"Proceedings of the 4th Annual ACM Symposium on the Theory of Computing","article-title":"Worst-Case Analysis of Memory Allocation Algorithms","author":"Garey","year":"1972"},{"key":"10.1016\/S0022-0000(74)80026-7_bib6","series-title":"Proceedings of the 4th Annual ACM Symposium on the Theory of Computing","article-title":"Approximation Algorithms for Combinatorial Problems","author":"Johnson","year":"1973"},{"key":"10.1016\/S0022-0000(74)80026-7_bib7","article-title":"Near-Optimal Allocation Algorithms","author":"Johnson","year":"1973"},{"key":"10.1016\/S0022-0000(74)80026-7_bib8","unstructured":"D. S. Johnson, J. D. Ullman, A. Demers, R. L. Graham, and M. R. Garey, in preparation."},{"key":"10.1016\/S0022-0000(74)80026-7_bib9","series-title":"Complexity of Computer Computations","article-title":"Reducibility Among Combinatorial Problems","author":"Karp","year":"1972"},{"key":"10.1016\/S0022-0000(74)80026-7_bib10","series-title":"Proceedings of the 4th Annual ACM Symposium on the Theory of Computing","article-title":"Binary Search Trees of Bounded Balance","author":"Nievergel","year":"1972"},{"key":"10.1016\/S0022-0000(74)80026-7_bib11","article-title":"The Performance of a Memory Allocation Algorithm","author":"Ullman","year":"1971"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000074800267?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000074800267?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T23:52:20Z","timestamp":1544140340000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000074800267"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,6]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1974,6]]}},"alternative-id":["S0022000074800267"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(74)80026-7","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1974,6]]}}}