{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T14:54:50Z","timestamp":1761663290673,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,5]]},"DOI":"10.1109\/mipro.2014.6859707","type":"proceedings-article","created":{"date-parts":[[2014,7,30]],"date-time":"2014-07-30T16:19:16Z","timestamp":1406737156000},"page":"959-965","source":"Crossref","is-referenced-by-count":3,"title":["A new approach for maximum utilization of the mother steel plates for rectangular steel plates orders"],"prefix":"10.1109","author":[{"given":"Lasko","family":"Kasapinov","sequence":"first","affiliation":[]},{"given":"Mile","family":"Jovanov","sequence":"additional","affiliation":[]},{"given":"Dimitar","family":"Trajanov","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"15","article-title":"Optimization of two-dimensional guillotine cutting be Genetic Algorithms","author":"ono","year":"1998","journal-title":"EUFIT"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/MIPRO.2014.6859707"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1137\/0110015"},{"key":"11","article-title":"The multiple knapsack problem with color constraints","author":"dawande","year":"1998","journal-title":"CiteSeer"},{"key":"12","first-page":"151","article-title":"A branch-and-bound algorithm for solving one-dimensional cutting stock problems exactly","volume":"23","author":"scheithauer","year":"1995","journal-title":"Applicationes Mathematicae"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74970-7_8"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.11.6.863"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1287\/msom.3.4.387.9972"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(91)90293-5"},{"key":"7","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/S0377-2217(02)00125-X","article-title":"A cutting plane algorithm for the onedimensional cutting stock problem with multiple stock lengths","volume":"141","author":"belov","year":"2002","journal-title":"European Journal of Operational Research"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-007-0051-7"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-011-9113-8"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(90)90350-K"},{"journal-title":"Solving Steel Mill Slab Problems with Branch and Price","year":"2010","author":"heinz","key":"9"},{"key":"8","article-title":"An ACO algorithm for one-dimensional cutting stock problem","volume":"1","author":"eshghi","year":"2005","journal-title":"Journal of Industrial Engineering International"}],"event":{"name":"2014 37th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO)","start":{"date-parts":[[2014,5,26]]},"location":"Opatija, Croatia","end":{"date-parts":[[2014,5,30]]}},"container-title":["2014 37th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6849597\/6859515\/06859707.pdf?arnumber=6859707","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T17:35:52Z","timestamp":1498152952000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6859707\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/mipro.2014.6859707","relation":{},"subject":[],"published":{"date-parts":[[2014,5]]}}}