{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T18:32:01Z","timestamp":1775241121791,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2002,9]]},"DOI":"10.1016\/s0377-2217(02)00130-3","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T19:46:28Z","timestamp":1034279188000},"page":"359-370","source":"Crossref","is-referenced-by-count":118,"title":["A 2-exchange heuristic for nesting problems"],"prefix":"10.1016","volume":"141","author":[{"given":"A.Miguel","family":"Gomes","sequence":"first","affiliation":[]},{"given":"Jos\u00e9 F.","family":"Oliveira","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00130-3_BIB1","first-page":"1086","article-title":"A two-stage solution of the cutting-stock problem","volume":"71","author":"Adamowicz","year":"1972","journal-title":"Information Processing"},{"issue":"5","key":"10.1016\/S0377-2217(02)00130-3_BIB2","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1109\/TSMC.1980.4308483","article-title":"Optimal allocation of two-dimensional irregular shapes using heuristic search methods","volume":"SMC-10","author":"Albano","year":"1980","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"10.1016\/S0377-2217(02)00130-3_BIB3","unstructured":"R.C. Art Jr., An approach to the two-dimensional irregular cutting stock problem, Technical Report 36.Y08, IBM Cambridge Centre, 1966"},{"key":"10.1016\/S0377-2217(02)00130-3_BIB4","series-title":"Extend Abstracts of MIC'99","article-title":"Hybridising tabu search with optimisation techniques for irregular stock-cutting","author":"Bennel","year":"1999"},{"key":"10.1016\/S0377-2217(02)00130-3_BIB5","doi-asserted-by":"crossref","unstructured":"J. B\u0142a\u017cewicz, P. Hawryluk, R. Walkowiak, Using tabu search approach for solving the two-dimensional irregular cutting problem in tabu search, in: F. Glover, M. Laguna, E. Taillard, D. de Werra (Eds.), Tabu Search \u2013 volume 41 of Annals of Operations Research, J.C. Baltzer AG., 1993","DOI":"10.1007\/BF02022998"},{"key":"10.1016\/S0377-2217(02)00130-3_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\/S0377-2217(02)00130-3_BIB7","doi-asserted-by":"crossref","unstructured":"K.A. Dowsland, S. Vaid, W.B. Dowsland, An algorithm for polygon placement using a bottom-left strategy, European Journal of Operational Research 141(2), this issue","DOI":"10.1016\/S0377-2217(02)00131-5"},{"key":"10.1016\/S0377-2217(02)00130-3_BIB8","unstructured":"A.M. Gomes, Novas contribui\u00e7\u00f5es para o problema de posicionamento de figuras irregulares, Master's Thesis, Faculdade de Engenharia da Universidade do Porto, 1995"},{"key":"10.1016\/S0377-2217(02)00130-3_BIB9","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1016\/0377-2217(95)00021-H","article-title":"A compaction and separation algorithms for non-convex polygons and their applications","volume":"84","author":"Li","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00130-3_BIB10","unstructured":"A. Mahadevan, Optimization in Computer-Aided Pattern Packing, PhD Thesis, North Carolina State University, 1984"},{"key":"10.1016\/S0377-2217(02)00130-3_BIB11","series-title":"Applied Simulated Annealing","first-page":"255","article-title":"Algorithms for nesting problems","author":"Oliveira","year":"1993"},{"key":"10.1016\/S0377-2217(02)00130-3_BIB12","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s002910050105","article-title":"TOPOS \u2013 A new constructive algorithm for nesting problems","volume":"22","author":"Oliveira","year":"2000","journal-title":"OR Spektrum"},{"key":"10.1016\/S0377-2217(02)00130-3_BIB13","unstructured":"Y.G. Stoyan, Precise and approximate methods of problems in irregular allocation of non-convex polygons in a strip of minimal length, in: IFORS'93 Conference, Lisbon, 1993"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702001303?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702001303?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T07:16:46Z","timestamp":1578467806000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702001303"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,9]]}},"alternative-id":["S0377221702001303"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00130-3","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}