{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T21:04:28Z","timestamp":1781298268304,"version":"3.54.1"},"reference-count":119,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T00:00:00Z","timestamp":1778716800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.cor.2026.107535","type":"journal-article","created":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T02:35:44Z","timestamp":1778812544000},"page":"107535","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A parallel branch-and-bound-and-check algorithm for nesting"],"prefix":"10.1016","volume":"194","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2522-4222","authenticated-orcid":false,"given":"Juan J.","family":"Lastra-D\u00edaz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5568-9496","authenticated-orcid":false,"given":"M. Teresa","family":"Ortu\u00f1o","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.cor.2026.107535_b1","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1016\/j.disopt.2006.10.006","article-title":"Conflict analysis in mixed integer programming","volume":"4","author":"Achterberg","year":"2007","journal-title":"Discrete Optim."},{"key":"10.1016\/j.cor.2026.107535_b2","series-title":"Facets of Combinatorial Optimization: Festschrift for Martin Gr\u00d6tschel","first-page":"449","article-title":"Mixed integer programming: Analyzing 12 years of progress","author":"Achterberg","year":"2013"},{"issue":"1","key":"10.1016\/j.cor.2026.107535_b3","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":"Comput. Aided Des. Appl."},{"issue":"4","key":"10.1016\/j.cor.2026.107535_b4","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1109\/TSMC.1976.5408780","article-title":"A solution of the rectangular cutting-stock problem","volume":"SMC-6","author":"Adamowicz","year":"1976","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"1\u20132","key":"10.1016\/j.cor.2026.107535_b5","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0925-7721(01)00041-4","article-title":"Polygon decomposition for efficient construction of Minkowski sums","volume":"21","author":"Agarwal","year":"2002","journal-title":"Comput. Geom."},{"issue":"5","key":"10.1016\/j.cor.2026.107535_b6","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":"10","author":"Albano","year":"1980","journal-title":"Syst. Man Cybern. IEEE Trans. on"},{"issue":"2","key":"10.1016\/j.cor.2026.107535_b7","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1016\/j.ijpe.2013.04.007","article-title":"A branch & bound algorithm for cutting and packing irregularly shaped pieces","volume":"145","author":"Alvarez-Valdes","year":"2013","journal-title":"Int. J. Prod. Econ."},{"issue":"7","key":"10.1016\/j.cor.2026.107535_b8","doi-asserted-by":"crossref","first-page":"1487","DOI":"10.1016\/j.cor.2011.08.021","article-title":"New constructive algorithms for leather nesting in the automotive industry","volume":"39","author":"Alves","year":"2012","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107535_b9","doi-asserted-by":"crossref","DOI":"10.1155\/2017\/1670709","article-title":"A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems","volume":"2017","author":"Amaro J\u00fanior","year":"2017","journal-title":"Math. Probl. Eng."},{"key":"10.1016\/j.cor.2026.107535_b10","series-title":"An Approach to the Two Dimensional Irregular Cutting Stock Problem","author":"Art","year":"1966"},{"issue":"12","key":"10.1016\/j.cor.2026.107535_b11","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1016\/S0010-4485(00)00112-3","article-title":"A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms","volume":"33","author":"Babu","year":"2001","journal-title":"Computer-Aided Des."},{"issue":"6","key":"10.1016\/j.cor.2026.107535_b12","doi-asserted-by":"crossref","first-page":"1152","DOI":"10.1287\/opre.20.6.1152","article-title":"On the set-covering problem","volume":"20","author":"Balas","year":"1972","journal-title":"Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107535_b13","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/S0305-0548(00)00021-6","article-title":"The irregular cutting-stock problem\u2014a new procedure for deriving the no-fit polygon","volume":"28","author":"Bennell","year":"2001","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107535_b14","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/j.ejor.2006.11.038","article-title":"The geometry of nesting problems: A tutorial","volume":"184","author":"Bennell","year":"2008","journal-title":"European J. Oper. Res."},{"issue":"sup1","key":"10.1016\/j.cor.2026.107535_b15","doi-asserted-by":"crossref","first-page":"S93","DOI":"10.1057\/jors.2008.169","article-title":"A tutorial in irregular shape packing problems","volume":"60","author":"Bennell","year":"2009","journal-title":"J. Oper. Res. Soc."},{"issue":"2","key":"10.1016\/j.cor.2026.107535_b16","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/j.ijpe.2013.06.021","article-title":"Cutting and packing","volume":"145","author":"Bennell","year":"2013","journal-title":"Int. J. Prod. Econ."},{"issue":"1","key":"10.1016\/j.cor.2026.107535_b17","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/j.cor.2006.02.026","article-title":"A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums","volume":"35","author":"Bennell","year":"2008","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107535_b18","series-title":"Computational Geometry: Algorithms and Applications","author":"de Berg","year":"1997"},{"issue":"1","key":"10.1016\/j.cor.2026.107535_b19","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1287\/opre.50.1.3.17780","article-title":"Solving real-world linear programs: A decade and more of progress","volume":"50","author":"Bixby","year":"2002","journal-title":"Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107535_b20","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.ejor.2006.03.011","article-title":"Complete and robust no-fit polygon generation for the irregular stock cutting problem","volume":"179","author":"Burke","year":"2007","journal-title":"European J. Oper. Res."},{"issue":"4-part-1","key":"10.1016\/j.cor.2026.107535_b21","doi-asserted-by":"crossref","first-page":"948","DOI":"10.1287\/opre.1090.0770","article-title":"Irregular packing using the line and arc no-fit polygon","volume":"58","author":"Burke","year":"2010","journal-title":"Oper. Res."},{"key":"10.1016\/j.cor.2026.107535_b22","series-title":"Proceedings of the 40th Annual Design Automation Conference","first-page":"830","article-title":"A fast pseudo-boolean constraint solver","author":"Chai","year":"2003"},{"issue":"3","key":"10.1016\/j.cor.2026.107535_b23","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1016\/j.ejor.2021.10.043","article-title":"A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation","volume":"300","author":"Chehrazad","year":"2022","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107535_b24","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/BF02614623","article-title":"Wheel inequalities for stable set polytopes","volume":"77","author":"Cheng","year":"1997","journal-title":"Math. Program."},{"key":"10.1016\/j.cor.2026.107535_b25","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s101070100267","article-title":"Antiweb-wheel inequalities and their separation problems over the stable set polytopes","volume":"92","author":"Cheng","year":"2002","journal-title":"Math. Program."},{"key":"10.1016\/j.cor.2026.107535_b26","series-title":"Proceedings of the ASME 1991 Design Technical Conferences. 17th Design Automation Conference: Volume 2 \u2014 Computer-Aided Design, Mechanical Systems Simulation, and Analysis, Mechanisms, and Robotics","first-page":"221","article-title":"Algorithms for nesting of ship\/offshore structural plates","author":"Cheok","year":"1991"},{"issue":"3","key":"10.1016\/j.cor.2026.107535_b27","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1590\/0101-7438.2016.036.03.0447","article-title":"A model-based heurisitcs for the irregular strip packing problem","volume":"36","author":"Cherri","year":"2016","journal-title":"Pesqui. Oper."},{"issue":"23","key":"10.1016\/j.cor.2026.107535_b28","doi-asserted-by":"crossref","first-page":"7085","DOI":"10.1080\/00207543.2017.1413256","article-title":"An innovative data structure to handle the geometry of nesting problems","volume":"56","author":"Cherri","year":"2018","journal-title":"Int. J. Prod. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107535_b29","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1016\/j.ejor.2016.03.009","article-title":"Robust mixed-integer linear programming models for the irregular strip packing problem","volume":"253","author":"Cherri","year":"2016","journal-title":"European J. Oper. Res."},{"issue":"4","key":"10.1016\/j.cor.2026.107535_b30","doi-asserted-by":"crossref","DOI":"10.1371\/journal.pone.0229358","article-title":"Positions and covering: A two-stage methodology to obtain optimal solutions for the 2d-bin packing problem","volume":"15","author":"Cid-Garcia","year":"2020","journal-title":"PLoS One"},{"issue":"1","key":"10.1016\/j.cor.2026.107535_b31","doi-asserted-by":"crossref","DOI":"10.1371\/journal.pone.0245267","article-title":"Exact solutions for the 2d-strip packing problem using the positions-and-covering methodology","volume":"16","author":"Cid-Garcia","year":"2021","journal-title":"PLoS One"},{"key":"10.1016\/j.cor.2026.107535_b32","doi-asserted-by":"crossref","DOI":"10.1016\/j.ic.2019.104464","article-title":"Large-scale clique cover of real-world networks","volume":"270","author":"Conte","year":"2020","journal-title":"Inform. and Comput."},{"key":"10.1016\/j.cor.2026.107535_b33","first-page":"50","article-title":"Geometry, shoemaking and the milk tray problem","volume":"123","author":"Cuninghame-Green","year":"1989","journal-title":"New Sci."},{"key":"10.1016\/j.cor.2026.107535_b34","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10107-004-0518-7","article-title":"Exploring relaxation induced neighborhoods to improve MIP solutions","volume":"102","author":"Danna","year":"2005","journal-title":"Math. Program."},{"key":"10.1016\/j.cor.2026.107535_b35","series-title":"Minimizing Waste in the 2-Dimensional Cutting Stock Problem","author":"Dean","year":"2002"},{"issue":"6","key":"10.1016\/j.cor.2026.107535_b36","doi-asserted-by":"crossref","first-page":"1521","DOI":"10.1016\/j.cor.2004.11.005","article-title":"An improved method for calculating the no-fit polygon","volume":"33","author":"Dean","year":"2006","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107535_b37","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0004-3702(90)90046-3","article-title":"Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition","volume":"41","author":"Dechter","year":"1990","journal-title":"Artificial Intelligence"},{"key":"10.1016\/j.cor.2026.107535_b38","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","article-title":"Benchmarking optimization software with performance profiles","volume":"91","author":"Dolan","year":"2002","journal-title":"Math. Program."},{"issue":"1","key":"10.1016\/j.cor.2026.107535_b39","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/0377-2217(92)90288-K","article-title":"Packing problems","volume":"56","author":"Dowsland","year":"1992","journal-title":"European J. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107535_b40","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 J. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107535_b41","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/S0377-2217(02)00131-5","article-title":"An algorithm for polygon placement using a bottom-left strategy","volume":"141","author":"Dowsland","year":"2002","journal-title":"European J. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107535_b42","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0377-2217(90)90350-K","article-title":"A typology of cutting and packing problems","volume":"44","author":"Dyckhoff","year":"1990","journal-title":"European J. Oper. Res."},{"issue":"10","key":"10.1016\/j.cor.2026.107535_b43","first-page":"14","article-title":"Automation of nesting and cutting processes of leather furniture production: a case study","volume":"9","author":"Elamvazuthi","year":"2009","journal-title":"Int. J. Mech. Mechatron. Eng."},{"issue":"2","key":"10.1016\/j.cor.2026.107535_b44","doi-asserted-by":"crossref","first-page":"327","DOI":"10.3390\/math11020327","article-title":"A hybrid reinforcement learning algorithm for 2D irregular packing problems","volume":"11","author":"Fang","year":"2023","journal-title":"Mathematics"},{"key":"10.1016\/j.cor.2026.107535_b45","first-page":"352","article-title":"Lazy clause generation reengineered","volume":"vol. 5732","author":"Feydy","year":"2009"},{"key":"10.1016\/j.cor.2026.107535_b46","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s10732-008-9088-9","article-title":"Mixed-integer programming models for nesting problems","volume":"15","author":"Fischetti","year":"2009","journal-title":"J. Heuristics"},{"issue":"3","key":"10.1016\/j.cor.2026.107535_b47","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0020-0190(81)90111-3","article-title":"Optimal packing and covering in the plane are NP-complete","volume":"12","author":"Fowler","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.cor.2026.107535_b48","series-title":"AAAI\u201994: Proceedings of the Twelfth AAAI National Conference on Artificial Intelligence","first-page":"294","article-title":"Dead-end driven learning","author":"Frost","year":"1994"},{"issue":"1","key":"10.1016\/j.cor.2026.107535_b49","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 Underst."},{"key":"10.1016\/j.cor.2026.107535_b50","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s10107-012-0513-3","article-title":"Strong lift-and-project cutting planes for the stable set problem","volume":"141","author":"Giandomenico","year":"2013","journal-title":"Math. Program."},{"issue":"1","key":"10.1016\/j.cor.2026.107535_b51","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1287\/opre.13.1.94","article-title":"Multistage cutting stock problems of two and more dimensions","volume":"13","author":"Gilmore","year":"1965","journal-title":"Oper. Res."},{"key":"10.1016\/j.cor.2026.107535_b52","series-title":"Innovative Intelligent Industrial Production and Logistics. IN4PL 2024","first-page":"115","article-title":"Comparative evaluation of irregular shape strip-packing algorithms","volume":"vol. 2372","author":"Giovenali","year":"2025"},{"issue":"2","key":"10.1016\/j.cor.2026.107535_b53","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/S0377-2217(02)00130-3","article-title":"A 2-exchange heuristic for nesting problems","volume":"141","author":"Gomes","year":"2002","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107535_b54","series-title":"Computational Geometry","first-page":"235","article-title":"The decomposition of polygons into convex parts","volume":"vol. 1","author":"Greene","year":"1983"},{"key":"10.1016\/j.cor.2026.107535_b55","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF01586932","article-title":"Solution of large-scale symmetric travelling salesman problems","volume":"51","author":"Gr\u00f6tschel","year":"1991","journal-title":"Math. Program."},{"key":"10.1016\/j.cor.2026.107535_b56","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.120548","article-title":"Efficient 2D irregular layout by vector superposition NFP and mixed-integer programming","volume":"230","author":"Guo","year":"2023","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2026.107535_b57","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1007\/s00773-018-0559-x","article-title":"Development of automatic nesting system for shipbuilding using the branch-and-bound method","volume":"24","author":"Hamada","year":"2019","journal-title":"J. Mar. Sci. Technol."},{"issue":"3","key":"10.1016\/j.cor.2026.107535_b58","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1016\/j.ejor.2013.04.048","article-title":"Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints","volume":"230","author":"Han","year":"2013","journal-title":"European J. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107535_b59","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","article-title":"Increasing tree search efficiency for constraint satisfaction problems","volume":"14","author":"Haralick","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/j.cor.2026.107535_b60","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02099695","article-title":"The nesting problem in the leather manufacturing industry","volume":"57","author":"Heistermann","year":"1995","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.cor.2026.107535_b61","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1023\/A:1012590107280","article-title":"A review of the application of meta-heuristic algorithms to 2D strip packing problems","volume":"16","author":"Hopper","year":"2001","journal-title":"Artif. Intell. Rev."},{"key":"10.1016\/j.cor.2026.107535_b62","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejco.2022.100031","article-title":"Progress in mathematical programming solvers from 2001 to 2020","volume":"10","author":"Koch","year":"2022","journal-title":"EURO J. Comput. Optim."},{"issue":"2","key":"10.1016\/j.cor.2026.107535_b63","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1016\/j.ejor.2017.10.014","article-title":"Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems","volume":"266","author":"Kreter","year":"2018","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107535_b64","series-title":"The CP-SAT primer - using and understanding google OR-tools\u2019 CP-SAT solver","author":"Krupke","year":"2025"},{"issue":"1","key":"10.1016\/j.cor.2026.107535_b65","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.ejor.2023.08.009","article-title":"Mixed-integer programming models for irregular strip packing based on vertical slices and feasibility cuts","volume":"313","author":"Lastra-D\u00edaz","year":"2024","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107535_b66","series-title":"Reproducibility dataset for a parallel branch-and-bound-and-check algorithm for nesting","author":"Lastra-D\u00edaz","year":"2025"},{"issue":"3","key":"10.1016\/j.cor.2026.107535_b67","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1080\/00207543.2015.1041571","article-title":"A semi-continuous MIP model for the irregular strip packing problem","volume":"54","author":"Leao","year":"2016","journal-title":"Int. J. Prod. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107535_b68","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1016\/j.ejor.2019.04.045","article-title":"Irregular packing problems: A review of mathematical models","volume":"282","author":"Leao","year":"2020","journal-title":"European J. Oper. Res."},{"issue":"6","key":"10.1016\/j.cor.2026.107535_b69","doi-asserted-by":"crossref","first-page":"489","DOI":"10.6028\/jres.084.024","article-title":"A graph coloring algorithm for large scheduling problems","volume":"84","author":"Leighton","year":"1979","journal-title":"J. Res. Natl. Bur. Stand."},{"issue":"1","key":"10.1016\/j.cor.2026.107535_b70","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/j.ipl.2004.01.006","article-title":"Exhaustive approaches to 2D rectangular perfect packings","volume":"90","author":"Lesh","year":"2004","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.cor.2026.107535_b71","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.105024","article-title":"The stable set problem: clique and nodal inequalities revisited","volume":"123","author":"Letchford","year":"2020","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107535_b72","series-title":"Compaction algorithms for non-convex polygons and their applications","author":"Li","year":"1994"},{"key":"10.1016\/j.cor.2026.107535_b73","series-title":"SCG\u201993: Proceedings of the Ninth Annual Symposium on Computational Geometry","first-page":"153","article-title":"A compaction algorithm for non-convex polygons and its application","author":"Li","year":"1993"},{"issue":"3","key":"10.1016\/j.cor.2026.107535_b74","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 applications","volume":"84","author":"Li","year":"1995","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107535_b75","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/s00170-010-2772-6","article-title":"Optimal positioning of irregular shapes in stamping die strip","volume":"52","author":"Licari","year":"2011","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"1\u20133","key":"10.1016\/j.cor.2026.107535_b76","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/S0166-218X(01)00347-X","article-title":"Recent advances on two-dimensional bin packing problems","volume":"123","author":"Lodi","year":"2002","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.cor.2026.107535_b77","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.105020","article-title":"Mixed integer linear programming and constraint programming models for the online printing shop scheduling problem","volume":"123","author":"Lunardi","year":"2020","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107535_b78","series-title":"Optimization in Computer-Aided Pattern Packing","author":"Mahadevan","year":"1984"},{"key":"10.1016\/j.cor.2026.107535_b79","series-title":"Handbook of Satisfiability","first-page":"131","article-title":"Conflict-driven clause learning SAT solvers","author":"Marques-Silva","year":"2009"},{"key":"10.1016\/j.cor.2026.107535_b80","unstructured":"Milenkovic, V., Daniels, K., Li, Z., 1991. Automatic marker making. In: Proc. of the Third Canadian Conf. on Comput. Geometry. Simon Fraser University, Vancouver, pp. 243\u2013246."},{"issue":"4","key":"10.1016\/j.cor.2026.107535_b81","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1142\/S0218195910003402","article-title":"Two approximate Minkowski sum algorithms","volume":"20","author":"Milenkovic","year":"2010","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"10.1016\/j.cor.2026.107535_b82","series-title":"Handbook of Applied Optimization","first-page":"65","article-title":"Branch-and-cut algorithms for combinatorial optimization problems","author":"Mitchell","year":"2002"},{"key":"10.1016\/j.cor.2026.107535_b83","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1016\/j.eswa.2017.03.059","article-title":"A biased random key genetic algorithm for open dimension nesting problems using no-fit raster","volume":"81","author":"Mundim","year":"2017","journal-title":"Expert Syst. Appl."},{"issue":"4","key":"10.1016\/j.cor.2026.107535_b84","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1287\/ijoc.2023.1287","article-title":"Mixed-integer programming vs. constraint programming for shop scheduling problems: New results and outlook","volume":"35","author":"Naderi","year":"2023","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.cor.2026.107535_b85","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1057\/jors.1992.71","article-title":"A strong cutting plane\/branch-and-bound algorithm for node packing","volume":"43","author":"Nemhauser","year":"1992","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"10.1016\/j.cor.2026.107535_b86","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1080\/10556788.2023.2246167","article-title":"IntSat: integer linear programming by conflict-driven constraint learning","volume":"39","author":"Nieuwenhuis","year":"2023","journal-title":"Optim. Methods Softw."},{"key":"10.1016\/j.cor.2026.107535_b87","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/s10601-008-9064-x","article-title":"Propagation via lazy clause generation","volume":"14","author":"Ohrimenko","year":"2009","journal-title":"Constraints"},{"key":"10.1016\/j.cor.2026.107535_b88","first-page":"255","article-title":"Algorithms for nesting problems","volume":"vol. 396","author":"Oliveira","year":"1993"},{"key":"10.1016\/j.cor.2026.107535_b89","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01580121","article-title":"On the facial structure of set packing polyhedra","volume":"5","author":"Padberg","year":"1973","journal-title":"Math. Program."},{"issue":"1","key":"10.1016\/j.cor.2026.107535_b90","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1137\/1033004","article-title":"A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems","volume":"33","author":"Padberg","year":"1991","journal-title":"SIAM Rev."},{"key":"10.1016\/j.cor.2026.107535_b91","doi-asserted-by":"crossref","first-page":"2414","DOI":"10.3390\/math12152414","article-title":"The normalized direct trigonometry model for the two-dimensional irregular strip packing problem","volume":"12","author":"Pantoja-Benavides","year":"2024","journal-title":"Mathematics"},{"key":"10.1016\/j.cor.2026.107535_b92","series-title":"29th International Conference on Principles and Practice of Constraint Programming (CP 2023)","first-page":"3:1","article-title":"The CP-SAT-LP solver","author":"Perron","year":"2023"},{"issue":"11","key":"10.1016\/j.cor.2026.107535_b93","doi-asserted-by":"crossref","first-page":"1159","DOI":"10.1080\/0951192X.2015.1036522","article-title":"A random-key genetic algorithm for solving the nesting problem","volume":"29","author":"Pinheiro","year":"2016","journal-title":"Int. J. Comput. Integr. Manuf."},{"key":"10.1016\/j.cor.2026.107535_b94","first-page":"352","article-title":"A constraint programming solution to the guillotine rectangular cutting problem","volume":"vol. 33","author":"Polyakovskiy","year":"2023"},{"issue":"4\u20135","key":"10.1016\/j.cor.2026.107535_b95","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1016\/j.engappai.2008.10.025","article-title":"A revision of recent approaches for two-dimensional strip-packing problems","volume":"22","author":"Riff","year":"2009","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.cor.2026.107535_b96","doi-asserted-by":"crossref","DOI":"10.1016\/j.disopt.2021.100628","article-title":"Fast constructive and improvement heuristics for edge clique covering","volume":"39","author":"Rodrigues","year":"2021","journal-title":"Discrete Optim."},{"key":"10.1016\/j.cor.2026.107535_b97","series-title":"ITM Web Conf. Vol. 14. The 12th International Conference Applied Mathematical Programming and Modelling APMOD 2016","first-page":"00005","article-title":"MIP models for the irregular strip packing problem: new symmetry breaking constraints","author":"Rodrigues","year":"2017"},{"key":"10.1016\/j.cor.2026.107535_b98","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/j.cor.2016.11.006","article-title":"A clique covering MIP model for the irregular strip packing problem","volume":"87","author":"Rodrigues","year":"2017","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107535_b99","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1016\/j.ejor.2019.06.008","article-title":"Raster penetration map applied to the irregular packing problem","volume":"279","author":"Sato","year":"2019","journal-title":"European J. Oper. Res."},{"issue":"11","key":"10.1016\/j.cor.2026.107535_b100","doi-asserted-by":"crossref","first-page":"1177","DOI":"10.1080\/0951192X.2015.1033018","article-title":"A pairwise exact placement algorithm for the irregular nesting problem","volume":"29","author":"Sato","year":"2016","journal-title":"Int. J. Comput. Integr. Manuf."},{"key":"10.1016\/j.cor.2026.107535_b101","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.119716","article-title":"A separation and compaction algorithm for the two-open dimension nesting problem using penetration-fit raster and obstruction map","volume":"220","author":"Sato","year":"2023","journal-title":"Expert Syst. Appl."},{"issue":"31","key":"10.1016\/j.cor.2026.107535_b102","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.ifacol.2016.12.176","article-title":"Study of the grid size impact on a raster based strip packing problem solution","volume":"49","author":"Sato","year":"2016","journal-title":"IFAC-PapersOnLine"},{"key":"10.1016\/j.cor.2026.107535_b103","series-title":"CgalDotNet project: .net wrapper for the computational geometry algorithms library","author":"Scrawk","year":"2022"},{"issue":"3","key":"10.1016\/j.cor.2026.107535_b104","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0097-8493(86)90007-5","article-title":"Optimal nesting of general plane figures: A monte carlo heuristical approach","volume":"10","author":"Segenreich","year":"1986","journal-title":"Comput. Graph."},{"key":"10.1016\/j.cor.2026.107535_b105","series-title":"LII Simp\u00f3sio Brasileiro de Oesquisa Operacional","doi-asserted-by":"crossref","DOI":"10.59254\/sbpo-2020-122549","article-title":"Modelo de programa\u00e7ao estoc\u00e1stica para um problema de corte de itens irregulares","author":"Rodrigues de Souza Queiroz","year":"2020"},{"key":"10.1016\/j.cor.2026.107535_b106","article-title":"Two effective methods for the irregular knapsack problem","volume":"95","author":"Rodrigues de Souza Queiroz","year":"2020","journal-title":"Appl. Soft Comput."},{"issue":"6","key":"10.1016\/j.cor.2026.107535_b107","doi-asserted-by":"crossref","first-page":"3486","DOI":"10.1111\/itor.13122","article-title":"A branch-and-cut algorithm for the irregular strip packing problem with uncertain demands","volume":"29","author":"Rodrigues de Souza Queiroz","year":"2022","journal-title":"Intl. Trans. Op. Res."},{"key":"10.1016\/j.cor.2026.107535_b108","first-page":"125","article-title":"A VNS based heuristic for a 2D open dimension problem","volume":"vol. 13863","author":"Rodrigues de Souza Queiroz","year":"2023"},{"key":"10.1016\/j.cor.2026.107535_b109","first-page":"5","article-title":"Lazy clause generation: combining the power of SAT and CP (and mip?) solving","volume":"vol. 6140","author":"Stuckey","year":"2010"},{"issue":"7","key":"10.1016\/j.cor.2026.107535_b110","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1057\/jors.1992.101","article-title":"Cutting and packing problems: A categorized, application-orientated research bibliography","volume":"43","author":"Sweeney","year":"1992","journal-title":"J. Oper. Res. Soc."},{"issue":"2","key":"10.1016\/j.cor.2026.107535_b111","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1016\/j.ijpe.2013.04.009","article-title":"The dotted-board model: A new MIP model for nesting irregular shapes","volume":"145","author":"Toledo","year":"2013","journal-title":"Int. J. Prod. Econ."},{"issue":"4","key":"10.1016\/j.cor.2026.107535_b112","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/0012-365X(75)90077-1","article-title":"A class of facet producing graphs for vertex packing polyhedra","volume":"12","author":"Trotter","year":"1975","journal-title":"Discrete Math."},{"issue":"3","key":"10.1016\/j.cor.2026.107535_b113","doi-asserted-by":"crossref","first-page":"1009","DOI":"10.1016\/j.ejor.2022.03.034","article-title":"Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes","volume":"303","author":"Umetani","year":"2022","journal-title":"European J. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107535_b114","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/j.ejor.2015.06.008","article-title":"Scheduling operating theatres: Mixed integer programming vs. constraint programming","volume":"247","author":"Wang","year":"2015","journal-title":"European J. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107535_b115","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/S0377-2217(02)00122-4","article-title":"Cutting and packing","volume":"141","author":"Wang","year":"2002","journal-title":"European J. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107535_b116","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","article-title":"An improved typology of cutting and packing problems","volume":"183","author":"W\u00e4scher","year":"2007","journal-title":"European J. Oper. Res."},{"issue":"10","key":"10.1016\/j.cor.2026.107535_b117","first-page":"1054","article-title":"An efficient algorithm for the regular W1 packing of polygons in the infinite plane","volume":"50","author":"Watson","year":"1999","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/j.cor.2026.107535_b118","series-title":"Proc. SPIE 2064, Machine Vision Applications, Architectures, and Systems Integration II","article-title":"Automated packing systems: Review of industrial implementations","author":"Whelan","year":"1993"},{"issue":"2","key":"10.1016\/j.cor.2026.107535_b119","first-page":"706","article-title":"Conflict-driven heuristics for mixed integer programming","volume":"33","author":"Witzig","year":"2021","journal-title":"INFORMS J. Comput."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030505482600153X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030505482600153X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T20:42:42Z","timestamp":1781296962000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030505482600153X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":119,"alternative-id":["S030505482600153X"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2026.107535","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A parallel branch-and-bound-and-check algorithm for nesting","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2026.107535","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"107535"}}