{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T20:17:50Z","timestamp":1771705070809,"version":"3.50.1"},"reference-count":20,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2001,3]]},"DOI":"10.1016\/s0305-0548(00)00021-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:16:12Z","timestamp":1027617372000},"page":"271-287","source":"Crossref","is-referenced-by-count":99,"title":["The irregular cutting-stock problem \u2014 a new procedure for deriving the no-fit polygon"],"prefix":"10.1016","volume":"28","author":[{"given":"Julia A.","family":"Bennell","sequence":"first","affiliation":[]},{"given":"Kathryn A.","family":"Dowsland","sequence":"additional","affiliation":[]},{"given":"William B.","family":"Dowsland","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0305-0548(00)00021-6_BIB1","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0010-4485(76)90006-3","article-title":"Nesting two dimensional shapes in rectangular modules","volume":"8","author":"Adamowicz","year":"1976","journal-title":"Computer Aided Design"},{"key":"10.1016\/S0305-0548(00)00021-6_BIB2","unstructured":"Art RC. An approach to the two dimensional irregular cutting stock problem. IBM Cambridge Scientific Centre, Report 36-Y08, 1966."},{"key":"10.1016\/S0305-0548(00)00021-6_BIB3","unstructured":"Bennell JA. Incorporating problem specific knowledge into a local search framework for the irregular shape packing problem. Ph.D. thesis, University of Wales, Swansea, 1998."},{"issue":"18","key":"10.1016\/S0305-0548(00)00021-6_BIB4","doi-asserted-by":"crossref","first-page":"4259","DOI":"10.1080\/002075499189763","article-title":"A tabu thresholding implementation for the irregular stock cutting problem","volume":"37","author":"Bennell","year":"1999","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0305-0548(00)00021-6_BIB5","unstructured":"Cuninghame-Green R. Geometry, shoemaking and the milk tray problem. New Scientist 12 August 1989; 1677 :50\u20133."},{"issue":"6","key":"10.1016\/S0305-0548(00)00021-6_BIB6","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1057\/palgrave.jors.2600563","article-title":"Jostling for position: local improvement for irregular cutting patterns","volume":"49","author":"Dowsland","year":"1998","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0305-0548(00)00021-6_BIB7","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1016\/0377-2217(95)00019-M","article-title":"Solution approaches to irregular nesting problems","volume":"84","author":"Dowsland","year":"1995","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"10.1016\/S0305-0548(00)00021-6_BIB8","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/0097-8493(93)90023-3","article-title":"A unified computational framework for minkowski operations","volume":"17","author":"Ghosh","year":"1993","journal-title":"Computers and Graphics"},{"issue":"1","key":"10.1016\/S0305-0548(00)00021-6_BIB9","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/1049-9660(91)90078-4","article-title":"An algebra of polygons through the notion of negative shapes","volume":"54","author":"Ghosh","year":"1991","journal-title":"CVGIP: Image Understanding"},{"key":"10.1016\/S0305-0548(00)00021-6_BIB10","series-title":"Convex polytopes","author":"Gr\u00fcnbaum","year":"1967"},{"key":"10.1016\/S0305-0548(00)00021-6_BIB11","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/BF02099693","article-title":"A simulated annealing approach to the nesting problem in the textile manufacturing industry","volume":"57","author":"Heckmann","year":"1995","journal-title":"Annals of Operational Research"},{"key":"10.1016\/S0305-0548(00)00021-6_BIB12","unstructured":"Konopasek M. Mathematical treatment of some apparel marking and cutting problems. US Department of Commerce Report, 99-26-90857-10, 1981."},{"key":"10.1016\/S0305-0548(00)00021-6_BIB13","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1016\/0377-2217(95)00021-H","article-title":"Compaction and separation algorithms for non-convex polygons and their application","volume":"84","author":"Li","year":"1995","journal-title":"European Journal of Operations Research"},{"key":"10.1016\/S0305-0548(00)00021-6_BIB14","unstructured":"Mahadevan A. Optimisation in computer aided pattern packing. Ph.D. thesis, North Carolina State University, 1984."},{"key":"10.1016\/S0305-0548(00)00021-6_BIB15","unstructured":"Milenkovic V, Daniels K, Li Z. Placement and compaction of non convex polygons for clothing manufacture. Fourth Canadian Conference on Computational Geometry, St John's, Newfoundland, 1992."},{"key":"10.1016\/S0305-0548(00)00021-6_BIB16","unstructured":"Oliveira JF, Gomes AM, Ferreira JS. A new constructive algorithm for nesting problems. Conference Paper, IFORS, Vancouver, BC, Canada, 1996."},{"key":"10.1016\/S0305-0548(00)00021-6_BIB17","doi-asserted-by":"crossref","unstructured":"Ramkumar GD. An algorithm to compute the minkowski sum outer-face of two simple polygons. Proceedings of the 12th Annual Symposium on Computational Geometry FCRC 96, 1996.","DOI":"10.1145\/237218.237374"},{"key":"10.1016\/S0305-0548(00)00021-6_BIB18","unstructured":"Special interest group on cutting and packing (SICUP), http:\/\/prodlog.wiwi.uni-halle.de\/sicup\/."},{"key":"10.1016\/S0305-0548(00)00021-6_BIB19","unstructured":"Stoyan YG, Ponomarenko LD. Minkowski sum and hodograph of the dense placement vector function. Reports of the SSR Academy of Science, SER.A 10, 1977."},{"key":"10.1016\/S0305-0548(00)00021-6_BIB20","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0045-7825(95)00795-3","article-title":"The optimal packing of arbitrarily-shaped polygons using simulated annealing and polynomial-time cooling schedules","volume":"125","author":"Theodoracatos","year":"1995","journal-title":"Computer Methods in Applied Mechanics and Engineering"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000216?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000216?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T03:27:40Z","timestamp":1556162860000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054800000216"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["S0305054800000216"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(00)00021-6","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}