{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T05:03:16Z","timestamp":1775624596162,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2008,12,1]],"date-time":"2008-12-01T00:00:00Z","timestamp":1228089600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artif Intell Rev"],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1007\/s10462-009-9120-y","type":"journal-article","created":{"date-parts":[[2009,10,23]],"date-time":"2009-10-23T06:10:03Z","timestamp":1256278203000},"page":"99-118","source":"Crossref","is-referenced-by-count":6,"title":["A global constraint for nesting problems"],"prefix":"10.1007","volume":"30","author":[{"given":"Cristina","family":"Ribeiro","sequence":"first","affiliation":[]},{"given":"Maria Ant\u00f3nia","family":"Carravilla","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,10,24]]},"reference":[{"key":"9120_CR1","volume-title":"Local search in combinatorial optimization","year":"1997","unstructured":"Aarts E, Lenstra JK (eds) (1997) Local search in combinatorial optimization. Wiley, New York"},{"key":"9120_CR2","unstructured":"Art R (1966) An approach to the two-dimensional, irregular cutting stock problem. Technical Report 36.008, IBM Cambridge Centre"},{"key":"9120_CR3","unstructured":"Bart\u00e1k R (1999) Constraint programming: in pursuit of the holy grail. In: Proceedings of the week of doctoral students (WDS99), Part IV, MatFyzPress, Prague, June 1999, pp. 555\u2013564."},{"key":"9120_CR4","first-page":"377","volume-title":"CP\u20192001, int. conf. on principles and practice of constraint programming, vol 2239 of lecture notes in computer science","author":"N Beldiceanu","year":"2001","unstructured":"Beldiceanu N, Carlsson M (2001) Sweep as a generic pruning technique applied to the non-overlapping rectangles constraint. In: Walsh T (eds) CP\u20192001, int. conf. on principles and practice of constraint programming, vol 2239 of lecture notes in computer science. Springer, Pisa, pp 377\u2013391"},{"key":"9120_CR5","first-page":"392","volume-title":"CP\u20192001, int. conf. on principles and practice of constraint programming, vol 2239 of lecture notes in computer science.","author":"N Beldiceanu","year":"2001","unstructured":"Beldiceanu N, Guo Q, Thiel S (2001) Non-overlapping constraints between convex polytopes. In: Walsh T (eds) CP\u20192001, int. conf. on principles and practice of constraint programming, vol 2239 of lecture notes in computer science. Springer, Pisa, pp 392\u2013407"},{"issue":"5","key":"9120_CR6","doi-asserted-by":"crossref","first-page":"1160","DOI":"10.1287\/mnsc.47.8.1160.10230","volume":"47","author":"JA Bennell","year":"2001","unstructured":"Bennell JA, Dowsland KA (2001) Hybridising tabu search with optimization techniques for irregular stock cutting. Manage Sci 47(5): 1160\u20131172","journal-title":"Manage Sci"},{"key":"9120_CR7","unstructured":"Bessi\u00e8re C, Hentenryck PV (2003) To be or not to be . . . a global constraint. In: CP, pp 789\u2013794"},{"key":"9120_CR8","doi-asserted-by":"crossref","unstructured":"B\u0142a\u017cewicz J, Hawryluk P, Walkowiak R (1993) Using tabu search approach for solving the two-dimensional irregular cutting problem in tabu search. In: Glover F, Laguna M, Taillard E, de Werra D (eds) Tabu search, vol 41 of Ann Oper Res. JC Baltzer AG","DOI":"10.1007\/BF02022998"},{"issue":"3","key":"9120_CR9","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1287\/ijoc.10.3.287","volume":"10","author":"A Bockmayr","year":"1998","unstructured":"Bockmayr A, Kasper T (1998) Branch-and-infer: a unifying framework for integer and finite domain constraint programming. INFORMS J Comput 10(3): 287\u2013300","journal-title":"INFORMS J Comput"},{"key":"9120_CR10","unstructured":"Carlsson M et\u00a0al (1995) SICStus prolog user\u2019s manual. Swedish Institute of Computer Science, September 2009"},{"key":"9120_CR11","first-page":"191","volume-title":"Programming languages: implementations, logics, and programming, vol 1292 of lecture notes in computer science","author":"M Carlsson","year":"1997","unstructured":"Carlsson M, Ottosson G, Carlson B (1997) An open-ended finite domain constraint solver. In: Glaser H, Hartel P, Kucken H (eds) Programming languages: implementations, logics, and programming, vol 1292 of lecture notes in computer science. Springer, Southampton, pp 191\u2013206"},{"issue":"6","key":"9120_CR12","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1111\/1475-3995.00434","volume":"10","author":"MA Carravilla","year":"2003","unstructured":"Carravilla MA, Ribeiro C, Oliveira JF (2003) Solving nesting problems with non-convex polygons by constraint logic programming. Int Trans Oper Res 10(6): 651\u2013663","journal-title":"Int Trans Oper Res"},{"issue":"1","key":"9120_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(87)90002-6","volume":"34","author":"R Dechter","year":"1987","unstructured":"Dechter R, Pearl J (1987) Network-based heuristics for constraint-satisfaction problems. Artif Intell 34(1): 1\u201338","journal-title":"Artif Intell"},{"key":"9120_CR14","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/0377-2217(92)90288-K","volume":"56","author":"K Dowsland","year":"1992","unstructured":"Dowsland K, Dowsland W (1992) Packing problems. Eur J Oper Res 56: 2\u201314","journal-title":"Eur J Oper Res"},{"key":"9120_CR15","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1016\/0377-2217(95)00019-M","volume":"84","author":"K Dowsland","year":"1995","unstructured":"Dowsland K, Dowsland W (1995) Solution approaches to irregular nesting problems. Eur J Oper Res 84: 506\u2013521","journal-title":"Eur J Oper Res"},{"key":"9120_CR16","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1057\/palgrave.jors.2600563","volume":"49","author":"K Dowsland","year":"1998","unstructured":"Dowsland K, Dowsland W, Bennell J (1998) Jostling for position: local improvement for irregular cutting patterns. J Oper Res Soc 49: 647\u2013658","journal-title":"J Oper Res Soc"},{"key":"9120_CR17","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1016\/S0377-2217(99)00033-8","volume":"121","author":"J Fernand\u00e9z","year":"2000","unstructured":"Fernand\u00e9z J, C\u00e1novas L, Pelegr\u00edn B (2000) Algorithms for the decomposition of a polygon into convex polygons. Eur J Oper Res 121: 330\u2013342","journal-title":"Eur J Oper Res"},{"issue":"2","key":"9120_CR18","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/S0377-2217(02)00130-3","volume":"141","author":"AM Gomes","year":"2002","unstructured":"Gomes AM, Oliveira JF (2002) A 2-exchange heuristic for nesting problems. Eur J Oper Res 141(2): 359\u2013370","journal-title":"Eur J Oper Res"},{"issue":"4","key":"9120_CR19","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1145\/242223.242279","volume":"28","author":"PV Hentenryck","year":"1996","unstructured":"Hentenryck PV, Saraswat VA (1996) Strategic directions in constraint programming. ACM Comput Surv 28(4): 701\u2013726","journal-title":"ACM Comput Surv"},{"key":"9120_CR20","unstructured":"Mahadevan A (1984) Optimization in computer-aided pattern packing. Ph.D. thesis, North Carolina State University"},{"issue":"4","key":"9120_CR21","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1023\/A:1011096320004","volume":"15","author":"I Miguel","year":"2001","unstructured":"Miguel I, Shen Q (2001) Solution techniques for constraint satisfaction problems: advanced approaches. Artif Intell Rev 15(4): 269\u2013293","journal-title":"Artif Intell Rev"},{"issue":"4","key":"9120_CR22","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1287\/ijoc.14.4.387.2830","volume":"14","author":"M Milano","year":"2002","unstructured":"Milano M, Ottosson G, Refalo P, Thorsteinsson ES (2002) The role of integer programming techniques in constraint-programming\u2019s global constraints. INFORMS J Comput 14(4): 387\u2013402","journal-title":"INFORMS J Comput"},{"key":"9120_CR23","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1111\/j.1475-3995.1999.tb00171.x","volume":"6","author":"V Milenkovic","year":"1999","unstructured":"Milenkovic V, Daniels K (1999) Translational polygon containment and minimal enclosure using mathematical programming. Int Trans Oper Res 6: 525\u2013554","journal-title":"Int Trans Oper Res"},{"key":"9120_CR24","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1023\/A:1014440424150","volume":"34","author":"G Ottosson","year":"2002","unstructured":"Ottosson G, Thorsteinsson ES, Hooker JN (2002) Mixed global constraints and inference in hybrid CLP-IP solvers. Ann Math Artif Intell 34: 271\u2013290","journal-title":"Ann Math Artif Intell"},{"key":"9120_CR25","doi-asserted-by":"crossref","unstructured":"Pralet C, Verfaillie G (2004) Travelling in the world of local searches in the space of partial assignments. In: CPAIOR. pp 240\u2013255","DOI":"10.1007\/978-3-540-24664-0_17"},{"issue":"1\u20134","key":"9120_CR26","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1023\/A:1021140902684","volume":"115","author":"S Prestwich","year":"2002","unstructured":"Prestwich S (2002) Combining the scalability of local search with the pruning techniques of systematic search. Ann Oper Res 115(1\u20134): 51\u201372","journal-title":"Ann Oper Res"},{"key":"9120_CR27","unstructured":"Ribeiro C, Carravilla MA (2005) CP and MIP in the resolution of hard combinatorial problems: a case study with nesting problems. In: Proceedings of CSCLP 2005:Joint ERCIM\/CologNet workshop on constraint solving and constraint logic programming, Uppsala, Sweden"},{"key":"9120_CR28","unstructured":"Ribeiro C, Carravilla MA, Oliveira JF (1999a) Applying constraint logic programming to the resolution of nesting problems. In: Workshop on integration of AI and OR techniques in constraint programming for combinatorial optimization problems"},{"issue":"2","key":"9120_CR29","first-page":"239","volume":"19","author":"C Ribeiro","year":"1999","unstructured":"Ribeiro C, Carravilla MA, Oliveira JF (1999b) Applying constraint logic programming to the resolution of nesting problems. Pesqui Operacional 19(2): 239\u2013247","journal-title":"Pesqui Operacional"},{"issue":"1","key":"9120_CR30","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0969-6016(98)00003-3","volume":"5","author":"Y Stoyan","year":"1998","unstructured":"Stoyan Y, Yaskov G (1998) Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints. Int Trans Oper Res 5(1): 45\u201357","journal-title":"Int Trans Oper Res"},{"key":"9120_CR31","volume-title":"Foundations of constraint satisfaction","author":"E Tsang","year":"1993","unstructured":"Tsang E (1993) Foundations of constraint satisfaction. Academic Press, New York"}],"container-title":["Artificial Intelligence Review"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10462-009-9120-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10462-009-9120-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10462-009-9120-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T17:45:07Z","timestamp":1559151907000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10462-009-9120-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12]]},"references-count":31,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["9120"],"URL":"https:\/\/doi.org\/10.1007\/s10462-009-9120-y","relation":{},"ISSN":["0269-2821","1573-7462"],"issn-type":[{"value":"0269-2821","type":"print"},{"value":"1573-7462","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,12]]}}}