{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T11:13:57Z","timestamp":1725966837864},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2005,10,18]],"date-time":"2005-10-18T00:00:00Z","timestamp":1129593600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Applic"],"published-print":{"date-parts":[[2006,3]]},"DOI":"10.1007\/s10589-005-3067-y","type":"journal-article","created":{"date-parts":[[2005,12,20]],"date-time":"2005-12-20T10:49:23Z","timestamp":1135075763000},"page":"287-301","source":"Crossref","is-referenced-by-count":8,"title":["Dynamic Programming Algorithms for Generating Optimal Strip Layouts"],"prefix":"10.1007","volume":"33","author":[{"given":"Yaodong","family":"Cui","sequence":"first","affiliation":[]},{"given":"Ling","family":"Huang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,10,18]]},"reference":[{"issue":"3","key":"3067_CR1","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1016\/0377-2217(93)90130-F","volume":"64","author":"P.K. Agrawal","year":"1993","unstructured":"P.K. Agrawal, \u201cMinimizing trim loss in cutting rectangular blanks of a single size form a rectangular sheet using orthogonal guillotine cuts,\u201d European Journal of Operational Research, vol. 64, no. 3, pp. 410\u2013422, 1993.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"3067_CR2","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1016\/S0278-6125(00)87642-6","volume":"18","author":"S. Anand","year":"1999","unstructured":"S. Anand, C. Mccord, and R. Sharma et al., \u201cAn integrated machine vision based system for solving the nonconvex cutting stock problem using genetic algorithms,\u201d Journal of Manufacturing Systems, vol. 18, no. 6, pp. 396\u2013415, 1999.","journal-title":"Journal of Manufacturing Systems"},{"key":"3067_CR3","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/S0377-2217(99)00265-9","volume":"123","author":"R. Andonov","year":"2000","unstructured":"R. Andonov, V. Poirrez, and S. Rajopadhye, \u201cUnbounded knapsack problem: Dynamic programming revisited,\u201d European Journal of Operational Research, vol. 123, pp. 394\u2013407, 2000.","journal-title":"European Journal of Operational Research"},{"key":"3067_CR4","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/S0377-2217(99)00454-3","volume":"125","author":"M.Z. Arslanov","year":"2000","unstructured":"M.Z. Arslanov, \u201cContinued fractions in optimal cutting of a rectangular sheet into equal small rectangles,\u201d European Journal of Operational Research, vol. 125, pp. 239\u2013248, 2000.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"3067_CR5","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0925-5273(94)00045-X","volume":"36","author":"C.H. Cheng","year":"1994","unstructured":"C.H. Cheng, B.R. Feiring, and T.C.E. Cheng, \u201cCutting stock problem\u2014a survey,\u201d International Journal of Production Economics, vol. 36, no. 3, pp. 291\u2013305, 1994.","journal-title":"International Journal of Production Economics"},{"key":"3067_CR6","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0924-0136(00)00402-7","volume":"103","author":"S.K. Cheng","year":"2000","unstructured":"S.K. Cheng and K.P. Rao, \u201cLarge-scale nesting of irregular patterns using compact neighborhood algorithm,\u201d Journal of Materials Processing Technology, vol. 103, pp. 135\u2013140, 2000.","journal-title":"Journal of Materials Processing Technology"},{"issue":"7","key":"3067_CR7","doi-asserted-by":"crossref","first-page":"1709","DOI":"10.1016\/j.cor.2003.11.022","volume":"32","author":"Y. Cui","year":"2005","unstructured":"Y. Cui, \u201cA cutting stock problem and its solution in the manufacturing industry of large electric generators,\u201d Computers & Operations Research, vol. 32, no. 7, pp. 1709\u20131721, 2005.","journal-title":"Computers & Operations Research"},{"key":"3067_CR8","doi-asserted-by":"crossref","first-page":"1338","DOI":"10.1057\/palgrave.jors.2601451","volume":"53","author":"Y. Cui","year":"2002","unstructured":"Y. Cui and R. Zhou, \u201cGenerating optimal cutting patterns for rectangular blanks of a single size,\u201d Journal of the Operational Research Society, vol. 53, pp. 1338\u20131346, 2002.","journal-title":"Journal of the Operational Research Society"},{"key":"3067_CR9","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/S0377-2217(02)00130-3","volume":"141","author":"A.M. Gomes","year":"2002","unstructured":"A.M. Gomes and J.F. Oliveira, \u201cA 2-exchange heuristic for nesting problems,\u201d European Journal of Operational Research, vol. 141, pp. 359\u2013370, 2002.","journal-title":"European Journal of Operational Research"},{"key":"3067_CR10","first-page":"30","volume":"I","author":"N. Lindecrantz","year":"1964","unstructured":"N. Lindecrantz, \u201cMethod for optimum cutting of rectangular sheets,\u201d Nordisk Tidskr. Informationsbehandling vol. I, pp. 30\u201335, 1964.","journal-title":"Nordisk Tidskr. Informationsbehandling"},{"key":"3067_CR11","volume-title":"Knapsack problems: Algorithms and Computer Implementations","author":"S. Martello","year":"1990","unstructured":"S. Martello and P. Toth, Knapsack problems: Algorithms and Computer Implementations. Wiley: New York, 1990."},{"key":"3067_CR12","doi-asserted-by":"crossref","first-page":"991","DOI":"10.1016\/S0890-6955(00)00115-2","volume":"41","author":"T.J. Nye","year":"2001","unstructured":"T.J. Nye, \u201cOptimal nesting of irregular convex blanks in strips via an exact algorithm,\u201d International Journal of Machine Tools & Manufacture, vol. 41, pp. 991\u20131002, 2001.","journal-title":"International Journal of Machine Tools & Manufacture"},{"key":"3067_CR13","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1016\/S0010-4485(00)00112-3","volume":"33","author":"A. Ramesh","year":"2001","unstructured":"A. Ramesh and N. Ramesh, \u201cA generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic,\u201d Computer-Aided Design, vol. 33, pp. 879\u2013891, 2001.","journal-title":"Computer-Aided Design"},{"key":"3067_CR14","first-page":"275","volume":"32","author":"A.G. Tarnowski","year":"1994","unstructured":"A.G. Tarnowski, J. Terno, and G. Scheithauer, \u201cA polynomial time algorithm for the guillotine pallet-loading problem,\u201d INFOR, vol. 32, pp. 275\u2013287, 1994.","journal-title":"INFOR"},{"issue":"1","key":"3067_CR15","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/S0305-0548(03)00208-9","volume":"32","author":"Y. Cui","year":"2005","unstructured":"Y. Cui, \u201cGenerating optimal T-shape cutting patterns for circular blanks,\u201d Computers & Operations Research, vol. 32, no. 1, pp. 143\u2013152, 2005.","journal-title":"Computers & Operations Research"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-005-3067-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-005-3067-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-005-3067-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T07:36:28Z","timestamp":1559288188000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-005-3067-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10,18]]},"references-count":15,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2006,3]]}},"alternative-id":["3067"],"URL":"https:\/\/doi.org\/10.1007\/s10589-005-3067-y","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,10,18]]}}}