Mixed-integer programming models for irregular strip packing based on vertical slices and feasibility cuts
Saved in:
| Published in | European journal of operational research Vol. 313; no. 1; pp. 69 - 91 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
16.02.2024
|
| Online Access | Get full text |
| ISSN | 0377-2217 1872-6860 |
| DOI | 10.1016/j.ejor.2023.08.009 |
Cover
| Author | Lastra-Díaz, Juan J. Ortuño, M. Teresa |
|---|---|
| Author_xml | – sequence: 1 givenname: Juan J. orcidid: 0000-0003-2522-4222 surname: Lastra-Díaz fullname: Lastra-Díaz, Juan J. – sequence: 2 givenname: M. Teresa orcidid: 0000-0002-5568-9496 surname: Ortuño fullname: Ortuño, M. Teresa |
| BookMark | eNqN0L1OwzAQwHEPRaIFXoDJL5BwttvaGVHFl1TEAnN0dS6Rg_Mh2wX69jQqEwNiuuHud8N_wWb90BNj1wJyAWJ90-bUDiGXIFUOJgcoZmwOSutMSqHP2SLGFgDESqzmrH12X1Rlrk_UUOBjGJqAXef6hndDRT7yegjchUDN3mPgMQU38hHt-3Syw0gVH3r-QSE5i55H7yxFjn3Fa8Lods67dOB2n-IlO6vRR7r6mRfs7f7udfOYbV8enja328wqI1KmKlrqpVSwRkMI2sidLiqjbVHUWmJd03GhtTWFqCwKY62ogABFoVAWgOqCqdPffT_i4RO9L8fgOgyHUkA5JSrbckpUTolKMOUx0VHJk7JhiDFQ_T9kfiHrEiY39Cmg83_Rb3NChXY |
| CitedBy_id | crossref_primary_10_1109_ACCESS_2024_3447092 crossref_primary_10_3390_math12152414 |
| Cites_doi | 10.1057/jors.1992.101 10.1016/j.ejor.2005.12.047 10.59254/sbpo-2021-131427 10.1016/j.ijpe.2013.06.021 10.59254/sbpo-2020-122549 10.1007/s10462-009-9120-y 10.1007/s00291-008-0128-5 10.1016/0377-2217(95)00019-M 10.1016/S0166-218X(01)00347-X 10.1016/0010-4485(76)90006-3 10.1080/00207543.2017.1413256 10.1080/0951192X.2015.1033018 10.1287/opre.13.1.94 10.1162/evco.1995.3.3.239 10.1287/opre.1060.0286 10.1023/A:1012590107280 10.1155/2017/1670709 10.1007/s10898-018-0638-x 10.1016/S0925-7721(01)00041-4 10.1016/j.comgeo.2009.12.003 10.3182/20140824-6-ZA-1003.01663 10.1016/S0377-2217(02)00122-4 10.1016/j.ejor.2013.04.048 10.1016/j.cor.2016.11.006 10.1016/j.ejor.2016.03.009 10.1016/j.compchemeng.2005.04.004 10.1080/00207543.2017.1394598 10.1080/00207543.2015.1041571 10.1007/s002910050105 10.1016/j.cor.2011.08.021 10.1016/j.ejor.2020.06.050 10.1007/s10898-015-0331-2 10.1109/TSMC.1980.4308483 10.1016/0377-2217(95)00038-0 10.1007/s10898-013-0129-z 10.1016/S0377-2217(99)00015-6 10.1016/0377-2217(90)90350-K 10.1155/2012/346358 10.1016/j.ejor.2019.06.008 10.1016/j.cie.2021.107467 10.1007/s101070100263 10.1007/s10898-007-9274-6 10.1007/s10479-015-1971-9 10.1016/j.ejor.2019.04.045 10.1590/0101-7438.2018.038.02.0195 10.1016/0377-2217(94)00166-9 10.1109/TSMC.1976.5408780 10.1016/j.eswa.2017.03.059 10.1016/j.ejor.2006.11.038 10.1007/BF02099695 10.1057/jors.2015.94 10.1016/S0377-2217(02)00130-3 10.1016/S0377-2217(02)00131-5 10.1016/j.ic.2019.104464 10.1016/j.ijpe.2013.04.007 10.1016/S0377-2217(99)00033-8 10.1016/j.orp.2019.100125 10.1057/jors.2008.169 10.1016/j.ejor.2013.06.020 10.1590/0101-7438.2016.036.03.0447 10.1016/0377-2217(95)00021-H 10.1080/0951192X.2015.1036522 10.1016/j.ejor.2022.07.050 10.1016/0020-0190(81)90111-3 10.1016/j.engappai.2008.10.025 10.1016/j.ijpe.2013.04.009 10.1016/j.ifacol.2016.12.176 10.1111/1475-3995.00434 10.1057/jors.2011.41 10.1007/s10732-008-9088-9 10.1080/00207543.2015.1102355 10.1051/itmconf/20171400005 10.1007/s10898-018-0637-y 10.1016/0377-2217(92)90288-K |
| ContentType | Journal Article |
| DBID | AAYXX CITATION ADTOC UNPAY |
| DOI | 10.1016/j.ejor.2023.08.009 |
| DatabaseName | CrossRef Unpaywall for CDI: Periodical Content Unpaywall |
| DatabaseTitle | CrossRef |
| Database_xml | – sequence: 1 dbid: UNPAY name: Unpaywall url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/ sourceTypes: Open Access Repository |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EndPage | 91 |
| ExternalDocumentID | 10.1016/j.ejor.2023.08.009 10_1016_j_ejor_2023_08_009 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1OL 1RT 1~. 1~5 29G 4.4 41~ 457 4G. 5GY 5VS 6OB 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AAEDT AAEDW AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AATTM AAXKI AAXUO AAYFN AAYWO AAYXX ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO ABWVN ABXDB ACDAQ ACGFO ACGFS ACIWK ACLOT ACNCT ACNNM ACRLP ACRPL ACVFH ACZNC ADBBV ADCNI ADEZE ADGUI ADIYS ADJOM ADMUD ADNMO ADXHL AEBSH AEFWE AEIPS AEKER AENEX AEUPX AFFNX AFJKZ AFPUW AFTJW AGHFR AGQPQ AGUBO AGYEJ AHHHB AHZHX AI. AIALX AIEXJ AIGII AIGVJ AIIUN AIKHN AITUG AKBMS AKRWK AKYEP ALMA_UNASSIGNED_HOLDINGS AMRAJ ANKPU AOUOD APLSM APXCP ARUGR ASPBG AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CITATION CS3 DU5 EBS EFJIC EFKBS EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX HVGLF HZ~ IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- ROL RPZ RXW SCC SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSV SSW SSZ T5K TAE TN5 U5U VH1 WUQ XPP ZMT ~02 ~G- ~HD ADTOC AGCQF UNPAY |
| ID | FETCH-LOGICAL-c381t-3de4742306a8ea0782b79d87c99f72affe6a877c891dca18cc1d0e0a193a290a3 |
| IEDL.DBID | UNPAY |
| ISSN | 0377-2217 1872-6860 |
| IngestDate | Tue Aug 19 14:01:02 EDT 2025 Thu Oct 09 00:13:44 EDT 2025 Thu Apr 24 23:01:48 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Language | English |
| License | cc-by-nc-nd |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c381t-3de4742306a8ea0782b79d87c99f72affe6a877c891dca18cc1d0e0a193a290a3 |
| ORCID | 0000-0003-2522-4222 0000-0002-5568-9496 |
| OpenAccessLink | https://proxy.k.utb.cz/login?url=https://doi.org/10.1016/j.ejor.2023.08.009 |
| PageCount | 23 |
| ParticipantIDs | unpaywall_primary_10_1016_j_ejor_2023_08_009 crossref_primary_10_1016_j_ejor_2023_08_009 crossref_citationtrail_10_1016_j_ejor_2023_08_009 |
| PublicationCentury | 2000 |
| PublicationDate | 2024-02-16 |
| PublicationDateYYYYMMDD | 2024-02-16 |
| PublicationDate_xml | – month: 02 year: 2024 text: 2024-02-16 day: 16 |
| PublicationDecade | 2020 |
| PublicationTitle | European journal of operational research |
| PublicationYear | 2024 |
| References | Al Theeb (10.1016/j.ejor.2023.08.009_bib0004) 2021; 159 Sato (10.1016/j.ejor.2023.08.009_bib0089) 2016; 49 de Berg (10.1016/j.ejor.2023.08.009_bib0031) 1997 Gomes (10.1016/j.ejor.2023.08.009_bib0045) 2002; 141 Puri (10.1016/j.ejor.2023.08.009_bib0074) 2013; 1 Adamowicz (10.1016/j.ejor.2023.08.009_bib0001) 1976; 8 Fischetti (10.1016/j.ejor.2023.08.009_bib0041) 2009; 15 Carravilla (10.1016/j.ejor.2023.08.009_bib0017) 2003; 10 Heistermann (10.1016/j.ejor.2023.08.009_bib0048) 1995 Amaro Júnior (10.1016/j.ejor.2023.08.009_bib0009) 2017; 2017 Stoyan (10.1016/j.ejor.2023.08.009_bib0096) 1996; 92 Alvarez-Valdes (10.1016/j.ejor.2023.08.009_bib0006) 2013; 145 Albano (10.1016/j.ejor.2023.08.009_bib0005) 1980; 10 Ribeiro (10.1016/j.ejor.2023.08.009_bib0075) 2004 Chernov (10.1016/j.ejor.2023.08.009_bib0020) 2012; 2012 Bennell (10.1016/j.ejor.2023.08.009_bib0014) 2009 Art (10.1016/j.ejor.2023.08.009_bib0011) 1966 Li (10.1016/j.ejor.2023.08.009_bib0062) 1995; 84 Santoro (10.1016/j.ejor.2023.08.009_bib0086) 2015; 235 Chernov (10.1016/j.ejor.2023.08.009_bib0019) 2010; 43 Fowler (10.1016/j.ejor.2023.08.009_bib0042) 1981; 12 Oliveira (10.1016/j.ejor.2023.08.009_bib0070) 2000; 22 Adamowicz (10.1016/j.ejor.2023.08.009_bib0002) 1976; SMC-6 Annamalai Vasantha (10.1016/j.ejor.2023.08.009_bib0010) 2016; 54 Greene (10.1016/j.ejor.2023.08.009_bib0046) 1983; vol. 1 Sato (10.1016/j.ejor.2023.08.009_bib0088) 2016; 29 Fernández (10.1016/j.ejor.2023.08.009_bib0040) 2000; 121 Cherri (10.1016/j.ejor.2023.08.009_bib0025) 2016; 253 Gilmore (10.1016/j.ejor.2023.08.009_bib0044) 1965; 13 Pankratov (10.1016/j.ejor.2023.08.009_bib0071) 2020 Sweeney (10.1016/j.ejor.2023.08.009_bib0098) 1992; 43 Atamtürk (10.1016/j.ejor.2023.08.009_bib0012) 2000; 121 Dowsland (10.1016/j.ejor.2023.08.009_bib0036) 2002; 141 Romanova (10.1016/j.ejor.2023.08.009_bib0085) 2020 Cherri (10.1016/j.ejor.2023.08.009_bib0021) 2019; 6 Stoyan (10.1016/j.ejor.2023.08.009_bib0093) 2017 Mifsud (10.1016/j.ejor.2023.08.009_bib0064) 1963; 6 Moore (10.1016/j.ejor.2023.08.009_bib0067) 2009; Vol. 2 Mundim (10.1016/j.ejor.2023.08.009_bib0068) 2018; 56 Pinheiro (10.1016/j.ejor.2023.08.009_bib0073) 2016; 29 Alves (10.1016/j.ejor.2023.08.009_bib0008) 2012; 39 Riff (10.1016/j.ejor.2023.08.009_bib0078) 2009; 22 Cherri (10.1016/j.ejor.2023.08.009_bib0022) 2016; 36 Cherri (10.1016/j.ejor.2023.08.009_bib0023) 2018; 56 Bennell (10.1016/j.ejor.2023.08.009_bib0015) 2013; 145 Moore (10.1016/j.ejor.2023.08.009_bib0066) 1966 Rodrigues de Souza (10.1016/j.ejor.2023.08.009_bib0083) 2020 Li (10.1016/j.ejor.2023.08.009_bib0061) 1993 Dowsland (10.1016/j.ejor.2023.08.009_bib0035) 1995; 84 Stoyan (10.1016/j.ejor.2023.08.009_bib0092) 2016; 65 Stoyan (10.1016/j.ejor.2023.08.009_bib0097) 2012; 63 Stoyan (10.1016/j.ejor.2023.08.009_bib0094) 2013 Rodrigues de Souza (10.1016/j.ejor.2023.08.009_bib0084) 2022 Leao (10.1016/j.ejor.2023.08.009_bib0057) 2021 Dighe (10.1016/j.ejor.2023.08.009_bib0032) 1995; 3 Toledo (10.1016/j.ejor.2023.08.009_bib0099) 2013; 145 Hopper (10.1016/j.ejor.2023.08.009_bib0049) 2000 Jones (10.1016/j.ejor.2023.08.009_bib0053) 2014; 59 Kimms (10.1016/j.ejor.2023.08.009_bib0055) 2022; 306 Whelan (10.1016/j.ejor.2023.08.009_bib0103) 1993 Cherri (10.1016/j.ejor.2023.08.009_bib0024) 2018; 72 Wang (10.1016/j.ejor.2023.08.009_bib0101) 2002; 141 10.1016/j.ejor.2023.08.009_bib0029 Elamvazuthi (10.1016/j.ejor.2023.08.009_bib0038) 2009; 9 Rocha (10.1016/j.ejor.2023.08.009_bib0080) 2014; 47 Rodrigues (10.1016/j.ejor.2023.08.009_bib0082) 2017; 87 Agarwal (10.1016/j.ejor.2023.08.009_bib0003) 2002; 21 Dyckhoff (10.1016/j.ejor.2023.08.009_bib0037) 1990; 44 Jakobs (10.1016/j.ejor.2023.08.009_bib0052) 1996; 88 Stoyan (10.1016/j.ejor.2023.08.009_bib0095) 2015 Conte (10.1016/j.ejor.2023.08.009_bib0027) 2020; 270 Elkeran (10.1016/j.ejor.2023.08.009_bib0039) 2013; 231 Bennell (10.1016/j.ejor.2023.08.009_bib0013) 2008; 184 Milenkovic (10.1016/j.ejor.2023.08.009_bib0065) 1991 Dowsland (10.1016/j.ejor.2023.08.009_bib0034) 1992; 56 Dolan (10.1016/j.ejor.2023.08.009_bib0033) 2002; 91 Carravilla (10.1016/j.ejor.2023.08.009_bib0016) 2005 Peralta (10.1016/j.ejor.2023.08.009_bib0072) 2018; 38 Rocha (10.1016/j.ejor.2023.08.009_bib0079) 2016 Cuninghame-Green (10.1016/j.ejor.2023.08.009_bib0028) 1989; 123 Hopper (10.1016/j.ejor.2023.08.009_bib0050) 2001; 16 Sato (10.1016/j.ejor.2023.08.009_bib0087) 2019; 279 Álvarez-Valdés (10.1016/j.ejor.2023.08.009_bib0007) 2009; 31 Stoyan (10.1016/j.ejor.2023.08.009_bib0091) 2016; 67 Sawaya (10.1016/j.ejor.2023.08.009_bib0090) 2005; 29 10.1016/j.ejor.2023.08.009_bib0056 Ribeiro (10.1016/j.ejor.2023.08.009_bib0076) 2009; 30 Leao (10.1016/j.ejor.2023.08.009_bib0058) 2016; 54 Cheok (10.1016/j.ejor.2023.08.009_bib0018) 1991; 32 Codato (10.1016/j.ejor.2023.08.009_bib0026) 2006; 54 Wäscher (10.1016/j.ejor.2023.08.009_bib0102) 2007; 183 Leao (10.1016/j.ejor.2023.08.009_bib0059) 2020; 282 Han (10.1016/j.ejor.2023.08.009_bib0047) 2013; 230 Li (10.1016/j.ejor.2023.08.009_sbref0058) 1994 Rodrigues (10.1016/j.ejor.2023.08.009_bib0081) 2017; 14 Lodi (10.1016/j.ejor.2023.08.009_bib0063) 2002; 123 Mundim (10.1016/j.ejor.2023.08.009_bib0069) 2017; 81 Wang (10.1016/j.ejor.2023.08.009_bib0100) 2018; 71 Iori (10.1016/j.ejor.2023.08.009_bib0051) 2021; 289 Ribeiro (10.1016/j.ejor.2023.08.009_bib0077) 1999; 19 Fujita (10.1016/j.ejor.2023.08.009_bib0043) 1993 Kallrath (10.1016/j.ejor.2023.08.009_bib0054) 2009; 43 Dean (10.1016/j.ejor.2023.08.009_bib0030) 2002 |
| References_xml | – volume: 43 start-page: 691 year: 1992 ident: 10.1016/j.ejor.2023.08.009_bib0098 article-title: Cutting and packing problems: A categorized, application-orientated research bibliography publication-title: The Journal of the Operational Research Society doi: 10.1057/jors.1992.101 – volume: 183 start-page: 1109 year: 2007 ident: 10.1016/j.ejor.2023.08.009_bib0102 article-title: An improved typology of cutting and packing problems publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2005.12.047 – start-page: 1 year: 2021 ident: 10.1016/j.ejor.2023.08.009_bib0057 article-title: Enhanced solution for the irregular strip packing problem: Valid inequalities and branching priorities doi: 10.59254/sbpo-2021-131427 – volume: 145 start-page: 449 year: 2013 ident: 10.1016/j.ejor.2023.08.009_bib0015 article-title: Cutting and packing publication-title: International Journal of Production Economics doi: 10.1016/j.ijpe.2013.06.021 – year: 2020 ident: 10.1016/j.ejor.2023.08.009_bib0083 article-title: Modelo de programaçao estocástica para um problema de corte de itens irregulares doi: 10.59254/sbpo-2020-122549 – volume: 30 start-page: 99 year: 2009 ident: 10.1016/j.ejor.2023.08.009_bib0076 article-title: A global constraint for nesting problems publication-title: Artificial Intelligence Review doi: 10.1007/s10462-009-9120-y – volume: 31 start-page: 431 year: 2009 ident: 10.1016/j.ejor.2023.08.009_bib0007 article-title: A branch and bound algorithm for the strip packing problem publication-title: OR Spectrum doi: 10.1007/s00291-008-0128-5 – volume: 84 start-page: 506 year: 1995 ident: 10.1016/j.ejor.2023.08.009_bib0035 article-title: Solution approaches to irregular nesting problems publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(95)00019-M – volume: 123 start-page: 379 year: 2002 ident: 10.1016/j.ejor.2023.08.009_bib0063 article-title: Recent advances on two-dimensional bin packing problems publication-title: Discrete Applied Mathematics doi: 10.1016/S0166-218X(01)00347-X – volume: 8 start-page: 27 year: 1976 ident: 10.1016/j.ejor.2023.08.009_bib0001 article-title: Nesting two-dimensional shapes in rectangular modules publication-title: Computer-Aided Design and Applications doi: 10.1016/0010-4485(76)90006-3 – start-page: 153 year: 1993 ident: 10.1016/j.ejor.2023.08.009_bib0061 article-title: A compaction algorithm for non-convex polygons and its application – volume: 56 start-page: 7085 year: 2018 ident: 10.1016/j.ejor.2023.08.009_bib0023 article-title: An innovative data structure to handle the geometry of nesting problems publication-title: International Journal of Production Research doi: 10.1080/00207543.2017.1413256 – volume: 19 start-page: 239 year: 1999 ident: 10.1016/j.ejor.2023.08.009_bib0077 article-title: Applying constraint logic programming to the resolution of nesting problems publication-title: Pesquisa Operacional – volume: 29 start-page: 1177 year: 2016 ident: 10.1016/j.ejor.2023.08.009_bib0088 article-title: A pairwise exact placement algorithm for the irregular nesting problem publication-title: International Journal of Computer Integrated Manufacturing doi: 10.1080/0951192X.2015.1033018 – volume: 13 start-page: 94 year: 1965 ident: 10.1016/j.ejor.2023.08.009_bib0044 article-title: Multistage cutting stock problems of two and more dimensions publication-title: Operations Research doi: 10.1287/opre.13.1.94 – volume: 3 start-page: 239 year: 1995 ident: 10.1016/j.ejor.2023.08.009_bib0032 article-title: Solving pattern nesting problems with genetic algorithms employing task decomposition and contact detection publication-title: Evolutionary Computation doi: 10.1162/evco.1995.3.3.239 – volume: 54 start-page: 756 year: 2006 ident: 10.1016/j.ejor.2023.08.009_bib0026 article-title: Combinatorial benders’ cuts for mixed-integer linear programming publication-title: Operations Research doi: 10.1287/opre.1060.0286 – volume: 16 start-page: 257 year: 2001 ident: 10.1016/j.ejor.2023.08.009_bib0050 article-title: A review of the application of meta-heuristic algorithms to 2D strip packing problems publication-title: Artificial Intelligence Review doi: 10.1023/A:1012590107280 – ident: 10.1016/j.ejor.2023.08.009_bib0029 – start-page: 265 year: 2015 ident: 10.1016/j.ejor.2023.08.009_bib0095 article-title: Optimized object packings using quasi-phi-functions – volume: 2017 year: 2017 ident: 10.1016/j.ejor.2023.08.009_bib0009 article-title: A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems publication-title: Mathematical Problems in Engineering doi: 10.1155/2017/1670709 – volume: 9 year: 2009 ident: 10.1016/j.ejor.2023.08.009_bib0038 article-title: Automation of nesting and cutting processes of leather furniture production: A case study publication-title: International Journal of Mechanical & Mechatronics Engineering IJMME – volume: 72 start-page: 89 year: 2018 ident: 10.1016/j.ejor.2023.08.009_bib0024 article-title: Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations publication-title: Journal of Global Optimization doi: 10.1007/s10898-018-0638-x – volume: 21 start-page: 39 year: 2002 ident: 10.1016/j.ejor.2023.08.009_bib0003 article-title: Polygon decomposition for efficient construction of Minkowski sums publication-title: Computational Geometry: Theory and Applications doi: 10.1016/S0925-7721(01)00041-4 – volume: 43 start-page: 535 year: 2010 ident: 10.1016/j.ejor.2023.08.009_bib0019 article-title: Mathematical model and efficient algorithms for object packing problem publication-title: Computational Geometry: Theory and Applications doi: 10.1016/j.comgeo.2009.12.003 – volume: 47 start-page: 5235 year: 2014 ident: 10.1016/j.ejor.2023.08.009_bib0080 article-title: Circle covering representation for nesting problems with continuous rotations publication-title: IFAC Proceedings Volumes. Proc. of the 19th IFAC World Congress doi: 10.3182/20140824-6-ZA-1003.01663 – volume: 141 start-page: 239 year: 2002 ident: 10.1016/j.ejor.2023.08.009_bib0101 article-title: Cutting and packing publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(02)00122-4 – volume: 230 start-page: 495 year: 2013 ident: 10.1016/j.ejor.2023.08.009_bib0047 article-title: Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2013.04.048 – volume: 87 start-page: 221 year: 2017 ident: 10.1016/j.ejor.2023.08.009_bib0082 article-title: A clique covering MIP model for the irregular strip packing problem publication-title: Computers & Operations Research doi: 10.1016/j.cor.2016.11.006 – start-page: 214 year: 2020 ident: 10.1016/j.ejor.2023.08.009_bib0085 article-title: Decomposition algorithm for irregular placement problems – volume: 253 start-page: 570 year: 2016 ident: 10.1016/j.ejor.2023.08.009_bib0025 article-title: Robust mixed-integer linear programming models for the irregular strip packing problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2016.03.009 – start-page: 1 year: 2020 ident: 10.1016/j.ejor.2023.08.009_bib0071 article-title: Packing irregular polygons using quasi phi-functions – volume: 29 start-page: 1891 year: 2005 ident: 10.1016/j.ejor.2023.08.009_bib0090 article-title: A cutting plane method for solving linear generalized disjunctive programming problems publication-title: Computers & Chemical Engineering doi: 10.1016/j.compchemeng.2005.04.004 – year: 1997 ident: 10.1016/j.ejor.2023.08.009_bib0031 – volume: 56 start-page: 709 year: 2018 ident: 10.1016/j.ejor.2023.08.009_bib0068 article-title: A general heuristic for two-dimensional nesting problems with limited-size containers publication-title: International Journal of Production Research doi: 10.1080/00207543.2017.1394598 – volume: 54 start-page: 712 year: 2016 ident: 10.1016/j.ejor.2023.08.009_bib0058 article-title: A semi-continuous MIP model for the irregular strip packing problem publication-title: International Journal of Production Research doi: 10.1080/00207543.2015.1041571 – volume: 22 start-page: 263 year: 2000 ident: 10.1016/j.ejor.2023.08.009_bib0070 article-title: TOPOS–A new constructive algorithm for nesting problems publication-title: OR-Spektrum doi: 10.1007/s002910050105 – volume: 39 start-page: 1487 year: 2012 ident: 10.1016/j.ejor.2023.08.009_bib0008 article-title: New constructive algorithms for leather nesting in the automotive industry publication-title: Computers & Operations Research doi: 10.1016/j.cor.2011.08.021 – year: 1994 ident: 10.1016/j.ejor.2023.08.009_sbref0058 – volume: 289 start-page: 399 year: 2021 ident: 10.1016/j.ejor.2023.08.009_bib0051 article-title: Exact solution techniques for two-dimensional cutting and packing publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2020.06.050 – start-page: 243 year: 1991 ident: 10.1016/j.ejor.2023.08.009_bib0065 article-title: Automatic marker making – volume: 65 start-page: 283 year: 2016 ident: 10.1016/j.ejor.2023.08.009_bib0092 article-title: Quasi-phi-functions and optimal packing of ellipses publication-title: Journal of Global Optimization doi: 10.1007/s10898-015-0331-2 – start-page: 521 year: 2017 ident: 10.1016/j.ejor.2023.08.009_bib0093 article-title: Placement problems for irregular objects: Mathematical modeling, optimization and applications – volume: 10 start-page: 242 year: 1980 ident: 10.1016/j.ejor.2023.08.009_bib0005 article-title: Optimal allocation of two-Dimensional irregular shapes using heuristic search methods publication-title: IEEE Transactions on Systems, Man and Cybernetics doi: 10.1109/TSMC.1980.4308483 – volume: 92 start-page: 193 year: 1996 ident: 10.1016/j.ejor.2023.08.009_bib0096 article-title: Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(95)00038-0 – volume: 59 start-page: 367 year: 2014 ident: 10.1016/j.ejor.2023.08.009_bib0053 article-title: A fully general, exact algorithm for nesting irregular shapes publication-title: Journal of Global Optimization doi: 10.1007/s10898-013-0129-z – volume: 121 start-page: 40 issue: 1 year: 2000 ident: 10.1016/j.ejor.2023.08.009_bib0012 article-title: Conflict graphs in solving integer programming problems publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(99)00015-6 – volume: 44 start-page: 145 year: 1990 ident: 10.1016/j.ejor.2023.08.009_bib0037 article-title: A typology of cutting and packing problems publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(90)90350-K – volume: 2012 year: 2012 ident: 10.1016/j.ejor.2023.08.009_bib0020 article-title: Phi-functions for 2D objects formed by line segments and circular arcs publication-title: Advances in Operations Research doi: 10.1155/2012/346358 – year: 1966 ident: 10.1016/j.ejor.2023.08.009_bib0066 – volume: 279 start-page: 657 year: 2019 ident: 10.1016/j.ejor.2023.08.009_bib0087 article-title: Raster penetration map applied to the irregular packing problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2019.06.008 – volume: 159 start-page: 107467 year: 2021 ident: 10.1016/j.ejor.2023.08.009_bib0004 article-title: New strategy to improve the dotted board model for solving two dimensional cutting and packing problems publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2021.107467 – volume: 91 start-page: 201 year: 2002 ident: 10.1016/j.ejor.2023.08.009_bib0033 article-title: Benchmarking optimization software with performance profiles publication-title: Mathematical Programming. A Publication of the Mathematical Programming Society doi: 10.1007/s101070100263 – volume: 43 start-page: 299 year: 2009 ident: 10.1016/j.ejor.2023.08.009_bib0054 article-title: Cutting circles and polygons from area-minimizing rectangles publication-title: Journal of Global Optimization doi: 10.1007/s10898-007-9274-6 – volume: 235 start-page: 693 year: 2015 ident: 10.1016/j.ejor.2023.08.009_bib0086 article-title: Irregular packing: MILP model based on a polygonal enclosure publication-title: Annals of Operations Research doi: 10.1007/s10479-015-1971-9 – volume: 282 start-page: 803 year: 2020 ident: 10.1016/j.ejor.2023.08.009_bib0059 article-title: Irregular packing problems: A review of mathematical models publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2019.04.045 – year: 1993 ident: 10.1016/j.ejor.2023.08.009_bib0103 article-title: Automated packing systems: Review of industrial implementations publication-title: Machine Vision and Applications – start-page: 363 year: 2013 ident: 10.1016/j.ejor.2023.08.009_bib0094 article-title: Mathematical models of placement optimisation: Two- and three-dimensional problems and applications – volume: 38 start-page: 195 year: 2018 ident: 10.1016/j.ejor.2023.08.009_bib0072 article-title: Solving irregular strip packing problems with free rotations using separation lines publication-title: Pesquisa Operacional doi: 10.1590/0101-7438.2018.038.02.0195 – start-page: 113 year: 2005 ident: 10.1016/j.ejor.2023.08.009_bib0016 article-title: CP and MIP in the resolution of hard combinatorial problems: A case study with nesting problems – volume: 88 start-page: 165 year: 1996 ident: 10.1016/j.ejor.2023.08.009_bib0052 article-title: On genetic algorithms for the packing of polygons publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(94)00166-9 – volume: SMC-6 start-page: 302 year: 1976 ident: 10.1016/j.ejor.2023.08.009_bib0002 article-title: A solution of the rectangular cutting-stock problem publication-title: IEEE Transactions on Systems, Man, and Cybernetics doi: 10.1109/TSMC.1976.5408780 – volume: 6 start-page: 103 year: 1963 ident: 10.1016/j.ejor.2023.08.009_bib0064 article-title: Algorithm 154: Combination in lexicographical order publication-title: Communications of the ACM – volume: 81 start-page: 358 year: 2017 ident: 10.1016/j.ejor.2023.08.009_bib0069 article-title: A biased random key genetic algorithm for open dimension nesting problems using no-fit raster publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2017.03.059 – volume: 184 start-page: 397 year: 2008 ident: 10.1016/j.ejor.2023.08.009_bib0013 article-title: The geometry of nesting problems: A tutorial publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2006.11.038 – year: 1995 ident: 10.1016/j.ejor.2023.08.009_bib0048 article-title: The nesting problem in the leather manufacturing industry publication-title: Annals of Operations Research doi: 10.1007/BF02099695 – volume: 67 start-page: 786 year: 2016 ident: 10.1016/j.ejor.2023.08.009_bib0091 article-title: Cutting and packing problems for irregular objects with continuous rotations: Mathematical modelling and non-linear optimization publication-title: The Journal of the Operational Research Society doi: 10.1057/jors.2015.94 – volume: vol. 1 start-page: 235 year: 1983 ident: 10.1016/j.ejor.2023.08.009_bib0046 article-title: The decomposition of polygons into convex parts – volume: 141 start-page: 359 year: 2002 ident: 10.1016/j.ejor.2023.08.009_bib0045 article-title: A 2-exchange heuristic for nesting problems publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(02)00130-3 – volume: 141 start-page: 371 year: 2002 ident: 10.1016/j.ejor.2023.08.009_bib0036 article-title: An algorithm for polygon placement using a bottom-left strategy publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(02)00131-5 – volume: 123 start-page: 50 year: 1989 ident: 10.1016/j.ejor.2023.08.009_bib0028 article-title: Geometry, shoemaking and the milk tray problem publication-title: New Scientist – volume: 270 start-page: 104464 year: 2020 ident: 10.1016/j.ejor.2023.08.009_bib0027 article-title: Large-scale clique cover of real-world networks publication-title: Information and Computation doi: 10.1016/j.ic.2019.104464 – volume: Vol. 2 year: 2009 ident: 10.1016/j.ejor.2023.08.009_bib0067 – volume: 145 start-page: 463 year: 2013 ident: 10.1016/j.ejor.2023.08.009_bib0006 article-title: A branch & bound algorithm for cutting and packing irregularly shaped pieces publication-title: International Journal of Production Economics doi: 10.1016/j.ijpe.2013.04.007 – volume: 121 start-page: 330 year: 2000 ident: 10.1016/j.ejor.2023.08.009_bib0040 article-title: Algorithms for the decomposition of a polygon into convex polygons publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(99)00033-8 – volume: 6 start-page: 100125 year: 2019 ident: 10.1016/j.ejor.2023.08.009_bib0021 article-title: Optimality in nesting problems: New constraint programming models and a new global constraint for non-overlap publication-title: Operations Research Perspectives doi: 10.1016/j.orp.2019.100125 – start-page: S93 year: 2009 ident: 10.1016/j.ejor.2023.08.009_bib0014 article-title: A tutorial in irregular shape packing problems publication-title: The Journal of the Operational Research Society doi: 10.1057/jors.2008.169 – volume: 231 start-page: 757 year: 2013 ident: 10.1016/j.ejor.2023.08.009_bib0039 article-title: A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2013.06.020 – volume: 36 start-page: 447 year: 2016 ident: 10.1016/j.ejor.2023.08.009_bib0022 article-title: A model-based heuristic for the irregular strip packing problem publication-title: Pesquisa Operacional doi: 10.1590/0101-7438.2016.036.03.0447 – volume: 84 start-page: 539 year: 1995 ident: 10.1016/j.ejor.2023.08.009_bib0062 article-title: Compaction and separation algorithms for non-convex polygons and their applications publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(95)00021-H – start-page: 477 year: 1993 ident: 10.1016/j.ejor.2023.08.009_bib0043 article-title: Hybrid approach for optimal nesting using a genetic algorithm and a local minimization algorithm – year: 2022 ident: 10.1016/j.ejor.2023.08.009_bib0084 article-title: A branchandcut algorithm for the irregular strip packing problem with uncertain demands publication-title: International transactions in operational research: A Journal of The International Federation of Operational Research Societies – ident: 10.1016/j.ejor.2023.08.009_bib0056 – volume: 29 start-page: 1159 year: 2016 ident: 10.1016/j.ejor.2023.08.009_bib0073 article-title: A random-key genetic algorithm for solving the nesting problem publication-title: International Journal of Computer Integrated Manufacturing doi: 10.1080/0951192X.2015.1036522 – volume: 32 start-page: 221 year: 1991 ident: 10.1016/j.ejor.2023.08.009_bib0018 article-title: Algorithms for nesting of ship/offshore structural plates publication-title: American Society of Mechanical Engineers, Design Engineering Division (Publication) DE – year: 2002 ident: 10.1016/j.ejor.2023.08.009_bib0030 – volume: 306 start-page: 1202 issue: 3 year: 2022 ident: 10.1016/j.ejor.2023.08.009_bib0055 article-title: An extended model formulation for the two-dimensional irregular strip packing problem considering general industry-relevant aspects publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2022.07.050 – volume: 12 start-page: 133 year: 1981 ident: 10.1016/j.ejor.2023.08.009_bib0042 article-title: Optimal packing and covering in the plane are NP-complete publication-title: Information Processing Letters doi: 10.1016/0020-0190(81)90111-3 – year: 1966 ident: 10.1016/j.ejor.2023.08.009_bib0011 – volume: 22 start-page: 823 year: 2009 ident: 10.1016/j.ejor.2023.08.009_bib0078 article-title: A revision of recent approaches for two-dimensional strip-packing problems publication-title: Engineering Applications of Artificial Intelligence doi: 10.1016/j.engappai.2008.10.025 – year: 2000 ident: 10.1016/j.ejor.2023.08.009_bib0049 – volume: 145 start-page: 478 year: 2013 ident: 10.1016/j.ejor.2023.08.009_bib0099 article-title: The dotted-board model: A new MIP model for nesting irregular shapes publication-title: International Journal of Production Economics doi: 10.1016/j.ijpe.2013.04.009 – volume: 49 start-page: 143 year: 2016 ident: 10.1016/j.ejor.2023.08.009_bib0089 article-title: Study of the grid size impact on a raster based strip packing problem solution publication-title: IFAC-PapersOnLine doi: 10.1016/j.ifacol.2016.12.176 – volume: 10 start-page: 651 year: 2003 ident: 10.1016/j.ejor.2023.08.009_bib0017 article-title: Solving nesting problems with non-convex polygons by constraint logic programming publication-title: International Transactions in Operational Research: A Journal of The International Federation of Operational Research Societies doi: 10.1111/1475-3995.00434 – volume: 1 start-page: 21 year: 2013 ident: 10.1016/j.ejor.2023.08.009_bib0074 article-title: Efficacy of pattern making software in product development publication-title: International Journal of Advanced Quality Management – volume: 63 start-page: 379 year: 2012 ident: 10.1016/j.ejor.2023.08.009_bib0097 article-title: Solving an optimization packing problem of circles and non-convex polygons with rotations into a multiply connected region publication-title: The Journal of the Operational Research Society doi: 10.1057/jors.2011.41 – start-page: 175 year: 2016 ident: 10.1016/j.ejor.2023.08.009_bib0079 article-title: Constraint aggregation in non-linear programming models for nesting problems – start-page: 256 year: 2004 ident: 10.1016/j.ejor.2023.08.009_bib0075 article-title: A global constraint for nesting problems – volume: 15 start-page: 201 year: 2009 ident: 10.1016/j.ejor.2023.08.009_bib0041 article-title: Mixed-integer programming models for nesting problems publication-title: Journal of Heuristics doi: 10.1007/s10732-008-9088-9 – volume: 54 start-page: 4104 year: 2016 ident: 10.1016/j.ejor.2023.08.009_bib0010 article-title: Crowdsourcing solutions to 2D irregular strip packing problems from internet workers publication-title: International Journal of Production Research doi: 10.1080/00207543.2015.1102355 – volume: 14 start-page: 00005 year: 2017 ident: 10.1016/j.ejor.2023.08.009_bib0081 article-title: MIP models for the irregular strip packing problem: New symmetry breaking constraints publication-title: ITM Web of Conferences doi: 10.1051/itmconf/20171400005 – volume: 71 start-page: 935 year: 2018 ident: 10.1016/j.ejor.2023.08.009_bib0100 article-title: A customized branch-and-bound approach for irregular shape nesting publication-title: J. Global Optimiz. doi: 10.1007/s10898-018-0637-y – volume: 56 start-page: 2 year: 1992 ident: 10.1016/j.ejor.2023.08.009_bib0034 article-title: Packing problems publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(92)90288-K |
| SSID | ssj0001515 |
| Score | 2.4803786 |
| SourceID | unpaywall crossref |
| SourceType | Open Access Repository Enrichment Source Index Database |
| StartPage | 69 |
| Title | Mixed-integer programming models for irregular strip packing based on vertical slices and feasibility cuts |
| URI | https://doi.org/10.1016/j.ejor.2023.08.009 |
| UnpaywallVersion | publishedVersion |
| Volume | 313 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Baden-Württemberg Complete Freedom Collection (Elsevier) issn: 0377-2217 databaseCode: GBLVA dateStart: 20110101 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: true ssIdentifier: ssj0001515 providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier ScienceDirect issn: 0377-2217 databaseCode: .~1 dateStart: 19950101 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: true ssIdentifier: ssj0001515 providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier SD Complete Freedom Collection issn: 0377-2217 databaseCode: ACRLP dateStart: 19950105 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: true ssIdentifier: ssj0001515 providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals [SCFCJ] issn: 0377-2217 databaseCode: AIKHN dateStart: 19950105 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: true ssIdentifier: ssj0001515 providerName: Elsevier – providerCode: PRVLSH databaseName: Elsevier Journals issn: 0377-2217 databaseCode: AKRWK dateStart: 19770101 customDbUrl: isFulltext: true mediaType: online dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0001515 providerName: Library Specific Holdings |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Ba9swFH50CXTdYW2zlXVbiw69tQq2Y1vWsZSGUGjpoYH0ZJ4lGZJlTkgctu6w374nRSlJKSW7GIyfjZGe9T5Zn74P4IwqRlJgIriUGPHYJJqjQjokJpVSlWhKR5C9S3v9-GaQDLxMjt0Ls7F-73hYZjSxup1Rx0lt2r16zTQh3N2AZv_u_vLRLRMIwaPI2euGmYh4mqWB3yHz-kM2qtD7RTXFp184Hq-Vlu7-0qNo7hQJLaPkR3tRF23154Ve43ZvfQAfPcJkl8uUOIQdU7Vgd0Vwb8H-ysiB-e-6BR_WVAk_weh2-Nto7oQkKMozuH7SNeZ8c-aMgC4bzmbOxn7GrPPHlNHc2_51Z7YsajapmDN6pgxghGRpMGJYaVYa9HTcJ6YW9fwz9LvXD1c97i0ZuKLSXvOONrFd2w1SzAxaeFEIqTOhpCxFhGVp6IIQKpOhVhhmSoU6MAESTMRIBtg5gkY1qcwXYGUstRQUX5Rx3KGJeBoHlCFG0QhCIAWPIVx1Ua68Xrm1zRjnK2LaKLetnNtWzq2XZiCP4fz5nulSrePN6Ivnnt8i_Ov_hX-DPTqLLcM7TL9Do54tzAkBmLo4hXftv-Gpz99_82rs3g |
| linkProvider | Unpaywall |
| linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1bS8MwFA4ywcuDl6k4b-TBN430nuZRxCGC4oOD-VROkxScsxtbh85f70mWjiki-lIoPS0lOc350nz5PkJOsWLEOcScCQEBi3SsGEjAQ6wTIWQBurAE2fvkphPdduOuk8kxe2G-rN9bHpbuDYxuZxBaqU2zV285iRF3N8hy5_7h8skuE3DOgsDa6_opD1iSJp7bIfPzQ75UodVJOYTpG_T7C6WlvTnzKBpbRULDKHm5mFT5hfz4ptf4t7feIhsOYdLLWUpskyVdNslKTXBvks3ayIG677pJ1hdUCXdI7-75XStmhSQwyjG4XvEatb45Y4pAlz6PRtbGfkSN88eQ4tzb_HWnpiwqOiipNXrGDKCIZHEwolAqWmhwdNwplZNqvEs67evHqxvmLBmYxNJesVDpyKztegmkGgy8yLlQKZdCFDyAotB4gXOZCl9J8FMpfeVpDxAmQiA8CPdIoxyUep_QIhJKcIzPiygKcSKeRB5miJY4giBIgRbx6y7KpNMrN7YZ_awmpvUy08qZaeXMeGl6okXO5vcMZ2odv0afz3v-D-EH_ws_JGt4FhmGt58ckUY1muhjBDBVfuIy9xNrmOvg |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Mixed-integer+programming+models+for+irregular+strip+packing+based+on+vertical+slices+and+feasibility+cuts&rft.jtitle=European+journal+of+operational+research&rft.au=Lastra-D%C3%ADaz%2C+Juan+J.&rft.au=Ortu%C3%B1o%2C+M.+Teresa&rft.date=2024-02-16&rft.issn=0377-2217&rft.volume=313&rft.issue=1&rft.spage=69&rft.epage=91&rft_id=info:doi/10.1016%2Fj.ejor.2023.08.009&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_ejor_2023_08_009 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0377-2217&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0377-2217&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0377-2217&client=summon |