{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:23:53Z","timestamp":1759335833074},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319734408"},{"type":"electronic","value":"9783319734415"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-73441-5_37","type":"book-chapter","created":{"date-parts":[[2018,1,2]],"date-time":"2018-01-02T10:42:23Z","timestamp":1514889743000},"page":"350-357","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Heuristic Algorithm for 2D Cutting Stock\u00a0Problem"],"prefix":"10.1007","author":[{"given":"Georgi","family":"Evtimov","sequence":"first","affiliation":[]},{"given":"Stefka","family":"Fidanova","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,1,3]]},"reference":[{"key":"37_CR1","unstructured":"Alvarez-Valdes, R., Parajon, A., Tamarit, J.M.: A computational study of heuristic algorithms for two-dimensional cutting stock problems. In: 4th Metaheuristics International Conference (MIC 2001), pp. 16\u201320 (2001)"},{"issue":"3","key":"37_CR2","doi-asserted-by":"crossref","first-page":"1167","DOI":"10.1016\/j.ejor.2005.11.068","volume":"183","author":"R Alvarez-Valdes","year":"2007","unstructured":"Alvarez-Valdes, R., Parreno, F., Tamarit, J.M.: A Tabu Search algorithm for two dimensional non-guillotine cutting problems. Eur. J. Oper. Res. 183(3), 1167\u20131182 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"37_CR3","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.ejor.2007.08.007","volume":"191","author":"G Cintra","year":"2008","unstructured":"Cintra, G., Miyazawa, F., Wakabayashi, Y., Xavier, E.: Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation. Eur. J. Oper. Res. 191, 61\u201385 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"37_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-319-07644-7_7","volume-title":"Hybrid Metaheuristics","author":"F Dusberger","year":"2014","unstructured":"Dusberger, F., Raidl, G.R.: A variable neighborhood search using very large neighborhood structures for the 3-staged 2-dimensional cutting stock problem. In: Blesa, M.J., Blum, C., Vo\u00df, S. (eds.) HM 2014. LNCS, vol. 8457, pp. 85\u201399. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-07644-7_7"},{"key":"37_CR5","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/j.endm.2014.11.018","volume":"47","author":"F Dusberger","year":"2015","unstructured":"Dusberger, F., Raidl, G.R.: Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search. Electron. Notes Discret. Math. 47, 133\u2013140 (2015)","journal-title":"Electron. Notes Discret. Math."},{"issue":"3","key":"37_CR6","doi-asserted-by":"crossref","first-page":"1212","DOI":"10.1016\/j.ejor.2005.11.062","volume":"183","author":"JF Gon\u00e7alves","year":"2007","unstructured":"Gon\u00e7alves, J.F.: A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem. Eur. J. Oper. Res. 183(3), 1212\u20131229 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"37_CR7","doi-asserted-by":"publisher","unstructured":"Parmar, K., Prajapati, H., Dabhi, V.: Cutting stock problem: a survey of evolutionary computing based solution. In: Proceedings of Green Computing Communication and Electrical Engineering (2014). \nhttps:\/\/doi.org\/10.1109\/ICGCCEE.2014.6921411","DOI":"10.1109\/ICGCCEE.2014.6921411"},{"key":"37_CR8","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/S0166-218X(01)00347-X","volume":"123","author":"A Lodi","year":"2002","unstructured":"Lodi, A., Martello, S., Vigo, D.: Recent advances on two-dimensional bin packing problems. Discret. Appl. Math. 123, 379\u2013396 (2002)","journal-title":"Discret. Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Large-Scale Scientific Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-73441-5_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,1,2]],"date-time":"2018-01-02T10:51:44Z","timestamp":1514890304000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-73441-5_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319734408","9783319734415"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73441-5_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}