{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T19:50:06Z","timestamp":1773085806280,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2004,8,20]],"date-time":"2004-08-20T00:00:00Z","timestamp":1092960000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2005,1]]},"DOI":"10.1007\/s10107-004-0548-1","type":"journal-article","created":{"date-parts":[[2004,8,19]],"date-time":"2004-08-19T06:10:09Z","timestamp":1092895809000},"page":"519-530","source":"Crossref","is-referenced-by-count":14,"title":["The two-dimensional cutting stock problem revisited"],"prefix":"10.1007","volume":"102","author":[{"given":"Steven S.","family":"Seiden","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard J.","family":"Woeginger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2004,8,20]]},"reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/0196-6774(81)90034-1","volume":"2","author":"Baker","year":"1981","unstructured":"Baker, B.S., Brown, D.J., Katseff, H.P.: A 5\/4 algorithm for two-dimensional bin packing. J. Alg. 2, 348?368 (1981)","journal-title":"J. Alg."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1137\/0209064","volume":"9","author":"Baker","year":"1980","unstructured":"Baker, B.S., Coffman, E.G., Rivest, R.L.: Orthogonal packings in two dimensions. SIAM J. Comput. 9, 846?855 (1980)","journal-title":"SIAM J. Comput."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1137\/0212033","volume":"12","author":"Baker","year":"1983","unstructured":"Baker, B.S., Schwarz, J.S.: Shelf algorithms for two-dimensional packing problems. SIAM J. Comput. 12, 508?525 (1983)","journal-title":"SIAM J. Comput."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1137\/0209062","volume":"9","author":"Coffman","year":"1980","unstructured":"Coffman, E.G., Garey, M.R., Johnson, D.S., Tarjan, R.E.: Performance bounds for level-oriented two-dimensional packing algorithms. SIAM J. Comput. 9, 808?826 (1980)","journal-title":"SIAM J. Comput."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/S0020-0190(97)00120-8","volume":"63","author":"Csirik","year":"1997","unstructured":"Csirik, J., Woeginger, G.J.: Shelf algorithms for online strip packing. Inf. Proc. Lett. 63, 171?175 (1997)","journal-title":"Inf. Proc. Lett."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF02579456","volume":"1","author":"Vega","year":"1981","unstructured":"Fernandez de la Vega, W., Lueker, G.S.: Bin packing can be solved within 1+ ? in linear time. Combinatorica 1, 349?355 (1981)","journal-title":"Combinatorica"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/S0166-218X(97)00130-3","volume":"82","author":"Vega","year":"1998","unstructured":"Fernandez de la Vega, W., Zissimopoulos, V.: An approximation scheme for strip packing of rectangles with bounded dimensions. Discrete Appl. Math. 82, 93?101 (1998)","journal-title":"Discrete Appl. Math."},{"key":"CR8","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1287\/opre.13.1.94","volume":"13","author":"Gilmore","year":"1965","unstructured":"Gilmore, P.C., Gomory, R.E.: Multistage cutting stock problems of two and more dimensions. Oper. Res. 13, 94?120 (1965)","journal-title":"Oper. Res."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1137\/0210042","volume":"10","author":"Golan","year":"1981","unstructured":"Golan, I.: Performance bounds for orthogonal, oriented two-dimensional packing algorithms. SIAM J. Comput. 10, 571?582 (1981)","journal-title":"SIAM J. Comput."},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"Karmarkar, N., Karp, R.M.: An efficient approximation scheme for the one-dimensional bin packing problem. In: Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science (FOCS?1982), 1982, pp. 312?320","DOI":"10.1109\/SFCS.1982.61"},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"Kenyon, C., Remila, E.: Approximate strip packing. In: Proceedings of the 37th IEEE Symposium on Foundations of Computer Science (FOCS?1996), 1996, pp. 31?36","DOI":"10.1109\/SFCS.1996.548461"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1287\/moor.25.4.645.12118","volume":"25","author":"Kenyon","year":"2000","unstructured":"Kenyon, C., Remila, E.: A near-optimal solution to a two-dimensional cutting stock problem. Math. Oper. Res. 25, 645?656 (2000)","journal-title":"Math. Oper. Res."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1080\/00029890.1947.11991798","volume":"54","author":"Salzer","year":"1947","unstructured":"Salzer, H.E.: The approximation of numbers as sums of reciprocals. Am. Math. Monthly 54, 135?142 (1947)","journal-title":"Am. Math. Monthly"},{"key":"CR15","doi-asserted-by":"crossref","unstructured":"Sleator, D.D.K.D.B.: A 2.5 times optimal algorithm for packing in two dimensions. Inf. Proc. Lett. 10, 37?40 (1980)","DOI":"10.1016\/0020-0190(80)90121-0"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-004-0548-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-004-0548-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-004-0548-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:49:57Z","timestamp":1559123397000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-004-0548-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,8,20]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,1]]}},"alternative-id":["548"],"URL":"https:\/\/doi.org\/10.1007\/s10107-004-0548-1","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,8,20]]}}}