Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation

We investigate several two-dimensional guillotine cutting stock problems and their variants in which orthogonal rotations are allowed. We first present two dynamic programming based algorithms for the Rectangular Knapsack (RK) problem and its variants in which the patterns must be staged. The first...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	European journal of operational research Jg. 191; H. 1; S. 61 - 85
Hauptverfasser:	Cintra, G.F., Miyazawa, F.K., Wakabayashi, Y., Xavier, E.C.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 16.11.2008 Elsevier
Schriftenreihe:	European Journal of Operational Research
Schlagworte:	Applied sciences Column generation Cutting stock Dynamic programming Exact sciences and technology Flows in networks. Combinatorial problems Guillotine cutting Operational research and scientific management Operational research. Management science Strip packing Two-dimensional packing Two-dimensional packing Cutting stock Column generation Dynamic programming Strip packing Guillotine cutting Recurrence Cutting stock problem Bin packing problem Polynomial method Rotation Knapsack problem Polynomial time Packing
ISSN:	0377-2217, 1872-6860
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Abstract	We investigate several two-dimensional guillotine cutting stock problems and their variants in which orthogonal rotations are allowed. We first present two dynamic programming based algorithms for the Rectangular Knapsack (RK) problem and its variants in which the patterns must be staged. The first algorithm solves the recurrence formula proposed by Beasley; the second algorithm – for staged patterns – also uses a recurrence formula. We show that if the items are not so small compared to the dimensions of the bin, then these algorithms require polynomial time. Using these algorithms we solved all instances of the RK problem found at the OR-LIBRARY, including one for which no optimal solution was known. We also consider the Two-dimensional Cutting Stock problem. We present a column generation based algorithm for this problem that uses the first algorithm above mentioned to generate the columns. We propose two strategies to tackle the residual instances. We also investigate a variant of this problem where the bins have different sizes. At last, we study the Two-dimensional Strip Packing problem. We also present a column generation based algorithm for this problem that uses the second algorithm above mentioned where staged patterns are imposed. In this case we solve instances for two-, three- and four-staged patterns. We report on some computational experiments with the various algorithms we propose in this paper. The results indicate that these algorithms seem to be suitable for solving real-world instances. We give a detailed description (a pseudo-code) of all the algorithms presented here, so that the reader may easily implement these algorithms.
AbstractList	We investigate several two-dimensional guillotine cutting stock problems and their variants in which orthogonal rotations are allowed. We first present two dynamic programming based algorithms for the Rectangular Knapsack (RK) problem and its variants in which the patterns must be staged. The first algorithm solves the recurrence formula proposed by Beasley; the second algorithm - for staged patterns - also uses a recurrence formula. We show that if the items are not so small compared to the dimensions of the bin, then these algorithms require polynomial time. Using these algorithms we solved all instances of the RK problem found at the OR-LIBRARY, including one for which no optimal solution was known. We also consider the Two-dimensional Cutting Stock problem. We present a column generation based algorithm for this problem that uses the first algorithm above mentioned to generate the columns. We propose two strategies to tackle the residual instances. We also investigate a variant of this problem where the bins have different sizes. At last, we study the Two-dimensional Strip Packing problem. We also present a column generation based algorithm for this problem that uses the second algorithm above mentioned where staged patterns are imposed. In this case we solve instances for two-, three- and four-staged patterns. We report on some computational experiments with the various algorithms we propose in this paper. The results indicate that these algorithms seem to be suitable for solving real-world instances. We give a detailed description (a pseudo-code) of all the algorithms presented here, so that the reader may easily implement these algorithms. We investigate several two-dimensional guillotine cutting stock problems and their variants in which orthogonal rotations are allowed. We first present two dynamic programming based algorithms for the Rectangular Knapsack (RK) problem and its variants in which the patterns must be staged. The first algorithm solves the recurrence formula proposed by Beasley; the second algorithm – for staged patterns – also uses a recurrence formula. We show that if the items are not so small compared to the dimensions of the bin, then these algorithms require polynomial time. Using these algorithms we solved all instances of the RK problem found at the OR-LIBRARY, including one for which no optimal solution was known. We also consider the Two-dimensional Cutting Stock problem. We present a column generation based algorithm for this problem that uses the first algorithm above mentioned to generate the columns. We propose two strategies to tackle the residual instances. We also investigate a variant of this problem where the bins have different sizes. At last, we study the Two-dimensional Strip Packing problem. We also present a column generation based algorithm for this problem that uses the second algorithm above mentioned where staged patterns are imposed. In this case we solve instances for two-, three- and four-staged patterns. We report on some computational experiments with the various algorithms we propose in this paper. The results indicate that these algorithms seem to be suitable for solving real-world instances. We give a detailed description (a pseudo-code) of all the algorithms presented here, so that the reader may easily implement these algorithms.
Author	Xavier, E.C. Miyazawa, F.K. Cintra, G.F. Wakabayashi, Y.
Author_xml	– sequence: 1 givenname: G.F. surname: Cintra fullname: Cintra, G.F. email: glauberc@cefetce.br organization: Centro Federal de Educação Tecnológica do Ceará, Av. 13 de Maio 2081, 60040-531, Fortaleza, CE, Brazil – sequence: 2 givenname: F.K. surname: Miyazawa fullname: Miyazawa, F.K. email: fkm@ic.unicamp.br organization: Instituto de Computação, Universidade Estadual de Campinas, Caixa Postal 6176, 13084-971, Campinas, SP, Brazil – sequence: 3 givenname: Y. surname: Wakabayashi fullname: Wakabayashi, Y. email: yw@ime.usp.br organization: Instituto de Matemática e Estatı´stica, Universidade de São Paulo, Rua do Matão 1010, 05508-090 São Paulo, SP, Brazil – sequence: 4 givenname: E.C. surname: Xavier fullname: Xavier, E.C. email: ecx@usp.br organization: Escola de Artes, Ciências e Humanidades, Universidade de São Paulo, São Paulo, SP, Brazil
BackLink	http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=20398615$$DView record in Pascal Francis http://econpapers.repec.org/article/eeeejores/v_3a191_3ay_3a2008_3ai_3a1_3ap_3a61-85.htm$$DView record in RePEc
BookMark	eNp9UU1r3DAQFSWBbtL-gZ586dGuPtayDb2E0I9AoJfcxaw83mhjS0bSJuy_7yhbcughgtGThnlvmDdX7MIHj4x9EbwRXOhvhwYPITaS867hfUPwgW1E38la95pfsA1XXVdLKbqP7CqlA-dctKLdsJebeR-iy49LqqYQq_wS6tEt6JMLHubKHnN2fl-lHOxTBX6kV3RrtYJ9Kvk1ht2MRD6m8h1PHhZnS3ofYVlKrpBsmI-Lr_boMUIm6U_scoI54ed_eM0efv54uP1d3__5dXd7c1_blutcg9iNamwRdlK1sOMWoZVKDyNoHGimrbQT0IQwDcC5wh6GwaLcbpXVogd1ze7OshFXtGaNboF4MkiH_MJkno0CMQi6TxTkX0_gSpJipdDC9K15zAtpfT1rrZAszFMEb11605RcDb0WLdXJc52NIaWI01uJ4KZsyxxM6W7Ktgw1JCBS_x_JuvzqVI7g5vep389UJB-fHUaTrENvcXQRbTZjcO_R_wIML7Xc
CODEN	EJORDT
CitedBy_id	crossref_primary_10_1287_ijoc_2016_0693 crossref_primary_10_1016_j_cor_2019_05_005 crossref_primary_10_1007_s10479_020_03604_w crossref_primary_10_1016_j_apm_2019_02_034 crossref_primary_10_1016_j_mechatronics_2013_01_001 crossref_primary_10_1016_j_omega_2022_102738 crossref_primary_10_1287_ijoc_2018_0822 crossref_primary_10_1016_j_eswa_2020_114257 crossref_primary_10_1016_j_cor_2024_106777 crossref_primary_10_1007_s00291_020_00610_z crossref_primary_10_1016_j_cor_2013_02_026 crossref_primary_10_1080_00207540903317523 crossref_primary_10_1016_j_ejor_2013_05_042 crossref_primary_10_1007_s10479_014_1634_2 crossref_primary_10_1007_s10288_019_00419_9 crossref_primary_10_1080_00207543_2019_1630773 crossref_primary_10_1016_j_omega_2013_08_003 crossref_primary_10_1007_s40314_021_01421_w crossref_primary_10_1016_j_eswa_2025_126534 crossref_primary_10_1080_01605682_2019_1578914 crossref_primary_10_3390_app14188120 crossref_primary_10_1016_j_cor_2012_11_020 crossref_primary_10_1016_j_omega_2013_08_007 crossref_primary_10_1016_j_cor_2009_08_005 crossref_primary_10_1016_j_ejor_2018_06_016 crossref_primary_10_1016_j_ijpe_2013_04_031 crossref_primary_10_1016_j_ijpe_2013_04_032 crossref_primary_10_1016_j_ejor_2022_08_018 crossref_primary_10_1007_s12351_022_00735_9 crossref_primary_10_1016_j_ejor_2010_01_039 crossref_primary_10_1016_j_ejor_2010_01_037 crossref_primary_10_1016_j_ejor_2020_07_027 crossref_primary_10_1016_j_cor_2011_03_011 crossref_primary_10_1007_s10878_016_0088_7 crossref_primary_10_1080_0305215X_2012_658784 crossref_primary_10_1057_jors_2012_70 crossref_primary_10_1155_2009_732010 crossref_primary_10_1016_j_ejor_2025_04_036 crossref_primary_10_1057_jors_2011_6 crossref_primary_10_1080_03081079_2025_2534840 crossref_primary_10_20965_ijat_2022_p0269 crossref_primary_10_1111_itor_12077 crossref_primary_10_1057_jors_2015_8 crossref_primary_10_1016_j_cie_2023_109705 crossref_primary_10_1155_2024_4456261 crossref_primary_10_1007_s11590_012_0598_x crossref_primary_10_1016_j_cie_2022_108538 crossref_primary_10_1016_j_ejor_2022_02_023 crossref_primary_10_1016_j_cor_2009_06_005 crossref_primary_10_1016_j_ejor_2018_04_014 crossref_primary_10_1016_j_cie_2014_10_009 crossref_primary_10_1016_j_cie_2011_12_012 crossref_primary_10_1155_2021_3732720 crossref_primary_10_1016_j_endm_2014_11_018 crossref_primary_10_1016_j_ejor_2009_05_047 crossref_primary_10_1016_j_ejor_2011_10_047 crossref_primary_10_1155_2018_6971827 crossref_primary_10_1016_j_cor_2024_106792 crossref_primary_10_1016_j_cor_2012_03_001 crossref_primary_10_1007_s00291_013_0347_2 crossref_primary_10_1080_0305215X_2011_600757 crossref_primary_10_1007_s10479_019_03466_x crossref_primary_10_1016_j_procs_2017_06_009 crossref_primary_10_1080_00207543_2022_2136279 crossref_primary_10_1080_10556788_2015_1048860 crossref_primary_10_4028_www_scientific_net_AMM_391_287 crossref_primary_10_1016_j_ejor_2020_06_050 crossref_primary_10_1016_j_ijpe_2013_03_011 crossref_primary_10_1007_s13675_019_00113_9 crossref_primary_10_3390_pr11030790 crossref_primary_10_1080_0740817X_2012_725506 crossref_primary_10_1111_itor_13236 crossref_primary_10_1007_s10288_014_0274_3 crossref_primary_10_1080_00207543_2017_1394598 crossref_primary_10_1016_j_cor_2014_04_001 crossref_primary_10_1016_j_ejor_2014_02_059 crossref_primary_10_1016_j_procs_2014_05_204 crossref_primary_10_1007_s11814_016_0328_7 crossref_primary_10_1016_j_apm_2011_11_005 crossref_primary_10_1016_j_cor_2022_106044 crossref_primary_10_1016_j_ejor_2011_10_018 crossref_primary_10_1080_00207543_2015_1102355 crossref_primary_10_1016_j_eswa_2012_05_025 crossref_primary_10_1080_00207543_2023_2279129 crossref_primary_10_1016_j_ejor_2025_05_033
Cites_doi	10.1057/jors.1990.166 10.1016/0377-2217(90)90361-E 10.1016/j.ejor.2005.11.064 10.1023/B:JOCO.0000038915.62826.79 10.1137/0603007 10.1016/j.ejor.2004.11.016 10.1287/moor.1040.0112 10.1145/1060590.1060702 10.1287/opre.33.1.49 10.1007/s10107-002-0319-9 10.1007/BF01539705 10.1090/S0273-0979-1984-15317-5 10.1023/B:AURC.0000014721.38981.bb 10.1287/moor.25.4.645.12118 10.1016/0377-2217(95)00200-6 10.1287/opre.11.6.863 10.1016/0377-2217(92)90212-R 10.1016/0196-6774(81)90034-1 10.1287/opre.9.6.849 10.1287/opre.1060.0369 10.1016/0377-2217(95)00026-M 10.1057/jors.1985.51 10.1016/S0167-6377(03)00057-9 10.1016/S0305-0548(98)00008-2 10.1287/mnsc.47.6.864.9809 10.1287/opre.25.1.30 10.1007/s00291-002-0093-3 10.1016/j.ejor.2005.12.047 10.1137/0209062 10.1111/j.1475-3995.2000.tb00194.x 10.1090/conm/114/1097863 10.1109/SFCS.2002.1181973 10.1287/opre.13.1.94 10.1016/j.ejor.2005.09.053 10.1147/rd.165.0462 10.1287/ijoc.15.3.310.16082 10.1007/s10107-004-0548-1
ContentType	Journal Article
Copyright	2007 Elsevier B.V. 2008 INIST-CNRS
Copyright_xml	– notice: 2007 Elsevier B.V. – notice: 2008 INIST-CNRS
DBID	AAYXX CITATION IQODW DKI X2L
DOI	10.1016/j.ejor.2007.08.007
DatabaseName	CrossRef Pascal-Francis RePEc IDEAS RePEc
DatabaseTitle	CrossRef
DatabaseTitleList
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Computer Science Business Applied Sciences
EISSN	1872-6860
EndPage	85
ExternalDocumentID	eeeejores_v_3a191_3ay_3a2008_3ai_3a1_3ap_3a61_85_htm 20398615 10_1016_j_ejor_2007_08_007 S0377221707008831
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 AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO AAYFN AAYOK ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACIWK ACNCT ACNNM ACRLP ACZNC ADBBV ADEZE ADGUI ADIYS ADJOM ADMUD AEBSH AEFWE AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AI. AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR ASPBG AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC 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- RIG 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- 9DU AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADXHL AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD AFXIZ AGCQF AGRNS BNPGV IQODW SSH 02 08R 0R 1 41 6XO 8P AAPBV ABFLS ADALY DKI G- HZ IPNFZ K M MS PQEST STF X X2L
ID	FETCH-LOGICAL-c506t-a1bd3d5eab235ab0cea52369da6e903742cfa860af9a003e8a99ce2443c618a3
ISICitedReferencesCount	104
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000257186700006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0377-2217
IngestDate	Wed Aug 18 03:50:56 EDT 2021 Mon Jul 21 09:16:14 EDT 2025 Tue Nov 18 22:00:29 EST 2025 Sat Nov 29 01:40:53 EST 2025 Fri Feb 23 02:27:51 EST 2024
IsDoiOpenAccess	false
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	1
Keywords	Two-dimensional packing Cutting stock Column generation Dynamic programming Strip packing Guillotine cutting Recurrence Cutting stock problem Bin packing problem Polynomial method Rotation Knapsack problem Polynomial time Packing
Language	English
License	https://www.elsevier.com/tdm/userlicense/1.0 CC BY 4.0
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c506t-a1bd3d5eab235ab0cea52369da6e903742cfa860af9a003e8a99ce2443c618a3
OpenAccessLink	http://dx.doi.org/10.1016/j.ejor.2007.08.007
PageCount	25
ParticipantIDs	repec_primary_eeeejores_v_3a191_3ay_3a2008_3ai_3a1_3ap_3a61_85_htm pascalfrancis_primary_20398615 crossref_primary_10_1016_j_ejor_2007_08_007 crossref_citationtrail_10_1016_j_ejor_2007_08_007 elsevier_sciencedirect_doi_10_1016_j_ejor_2007_08_007
PublicationCentury	2000
PublicationDate	2008-11-16
PublicationDateYYYYMMDD	2008-11-16
PublicationDate_xml	– month: 11 year: 2008 text: 2008-11-16 day: 16
PublicationDecade	2000
PublicationPlace	Amsterdam
PublicationPlace_xml	– name: Amsterdam
PublicationSeriesTitle	European Journal of Operational Research
PublicationTitle	European journal of operational research
PublicationYear	2008
Publisher	Elsevier B.V Elsevier
Publisher_xml	– name: Elsevier B.V – name: Elsevier
References	Chung, Garey, Johnson (bib16) 1982; 3 Puchinger, Raidl (bib43) 2007; 183 Alvarez-Valdes, Parajon, Tamarit (bib2) 2002; 24 Miyazawa, Wakabayashi (bib38) 2004; vol. 2976 G.F. Cintra, Algoritmos hı´bridos para o problema de corte unidimensional, in: XXV Conferência Latinoamericana de Informática, Assunção, 1999. COIN-OR Linear Program Solver, An Open Source code for Solving Linear Programming Problems Wäscher, Haussner, Schumann (bib48) 2007; 183 Caprara, Lodi, Monaci (bib12) 2002 Epstein (bib25) 2003; vol. 2747 Gilmore, Gomory (bib29) 1965; 13 Bortfeldt (bib10) 2006; 172 Lodi, Monaci (bib36) 2003; 94 Herz (bib31) 1972 Vanderbeck (bib46) 2001; 47 Caprara, Monaci (bib14) 2004; 32 Martello, Monaci, Vigo (bib37) 2003; 15 K. Jansen, R. van Stee, On strip packing with rotations, in: Proceedings of the ACM Symposium on Theory of Computing, 2005, pp. 755–761. Kenyon, Rémila (bib34) 2000; 25 Arenales, Morábito (bib3) 1995; 84 Mukhacheva, Mukhacheva (bib40) 2004; 65 . Beasley (bib6) 1985; 33 Hifi (bib30) 1998; 25 Caprara, Lodi, Monaci (bib13) 2005; 30 Morábito, Arenales, Arcaro (bib39) 1992; 58 K. Jansen, G. Zhang, On rectangle packing: maximizing benefits, in: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, 2004, pp. 204–213. Seiden, Woeginger (bib45) 2005; 102 Beasley (bib5) 1985; 36 Cintra, Miyazawa, Wakabayashi, Xavier (bib19) 2007; 183 Beasley (bib7) 1990; 41 G.F. Cintra, Y. Wakabayashi, Dynamic programming and column generation based approaches for two-dimensional guillotine cutting problems, in: Proceedings of WEA 2004: Workshop on Efficient and Experimental Algorithms, Lecture Notes in Computer Science, vol. 3059, 2004, pp. 175–190. G. Belov, G. Scheithauer, Models with Variable Strip Widths for Two-dimensional Two-stage cutting 2003. Puchinger, Raidl (bib42) 2004; vol. 3242 Cung, Hifi, Cun (bib24) 2000; 7 Gilmore, Gomory (bib27) 1961; 9 Gilmore, Gomory (bib28) 1963; 11 Karl-Heinz Borgwardt, Probabilistic analysis of the simplex method, in: Brunswick, 1988 (Ed.), Mathematical Developments arising from Linear Programming, Contemp. Math., vol. 114, pp. 21–34, American Mathematical Society, Providence, RI, 1990. Oliveira, Ferreira (bib41) 1990; 44 Fekete, Schepers, van der Veen (bib26) 2007; 55 A. Caprara, Packing 2-dimensional bins in harmony, in: Proceedings of the 43rd Symposium on Foundations of Computer Science, 2002, pp. 490–499. Lodi, Martello, Vigo (bib35) 2004; 8 Riehme, Scheithauer, Terno (bib44) 1996; 91 Baker, Brown, Katseff (bib4) 1981; 2 Adler, Megiddo, Todd (bib1) 1984; 11 Christofides, Whitlock (bib15) 1977; 25 Coffman, Garey, Johnson, Tarjan (bib21) 1980; 9 G.F. Cintra, Algoritmos para problemas de corte de guilhotina bidimensional, PhD thesis, Instituto de Matemática e Estatı´stica, São Paulo, 2004. Wäscher, Gau (bib47) 1996; 18 Cormen, Leiserson, Rivest, Stein (bib23) 2001 Alvarez-Valdes (10.1016/j.ejor.2007.08.007_bib2) 2002; 24 Coffman (10.1016/j.ejor.2007.08.007_bib21) 1980; 9 Cormen (10.1016/j.ejor.2007.08.007_bib23) 2001 Chung (10.1016/j.ejor.2007.08.007_bib16) 1982; 3 Oliveira (10.1016/j.ejor.2007.08.007_bib41) 1990; 44 Beasley (10.1016/j.ejor.2007.08.007_bib7) 1990; 41 Gilmore (10.1016/j.ejor.2007.08.007_bib28) 1963; 11 10.1016/j.ejor.2007.08.007_bib32 Martello (10.1016/j.ejor.2007.08.007_bib37) 2003; 15 Hifi (10.1016/j.ejor.2007.08.007_bib30) 1998; 25 Seiden (10.1016/j.ejor.2007.08.007_bib45) 2005; 102 Morábito (10.1016/j.ejor.2007.08.007_bib39) 1992; 58 Bortfeldt (10.1016/j.ejor.2007.08.007_bib10) 2006; 172 Wäscher (10.1016/j.ejor.2007.08.007_bib47) 1996; 18 Adler (10.1016/j.ejor.2007.08.007_bib1) 1984; 11 10.1016/j.ejor.2007.08.007_bib11 10.1016/j.ejor.2007.08.007_bib33 10.1016/j.ejor.2007.08.007_bib18 Gilmore (10.1016/j.ejor.2007.08.007_bib27) 1961; 9 10.1016/j.ejor.2007.08.007_bib17 Lodi (10.1016/j.ejor.2007.08.007_bib36) 2003; 94 Miyazawa (10.1016/j.ejor.2007.08.007_bib38) 2004; vol. 2976 Lodi (10.1016/j.ejor.2007.08.007_bib35) 2004; 8 Beasley (10.1016/j.ejor.2007.08.007_bib5) 1985; 36 Wäscher (10.1016/j.ejor.2007.08.007_bib48) 2007; 183 10.1016/j.ejor.2007.08.007_bib9 10.1016/j.ejor.2007.08.007_bib8 Caprara (10.1016/j.ejor.2007.08.007_bib13) 2005; 30 Beasley (10.1016/j.ejor.2007.08.007_bib6) 1985; 33 Epstein (10.1016/j.ejor.2007.08.007_bib25) 2003; vol. 2747 Arenales (10.1016/j.ejor.2007.08.007_bib3) 1995; 84 Baker (10.1016/j.ejor.2007.08.007_bib4) 1981; 2 10.1016/j.ejor.2007.08.007_bib20 Puchinger (10.1016/j.ejor.2007.08.007_bib42) 2004; vol. 3242 Puchinger (10.1016/j.ejor.2007.08.007_bib43) 2007; 183 Cintra (10.1016/j.ejor.2007.08.007_bib19) 2007; 183 10.1016/j.ejor.2007.08.007_bib22 Caprara (10.1016/j.ejor.2007.08.007_bib14) 2004; 32 Gilmore (10.1016/j.ejor.2007.08.007_bib29) 1965; 13 Herz (10.1016/j.ejor.2007.08.007_bib31) 1972 Kenyon (10.1016/j.ejor.2007.08.007_bib34) 2000; 25 Vanderbeck (10.1016/j.ejor.2007.08.007_bib46) 2001; 47 Mukhacheva (10.1016/j.ejor.2007.08.007_bib40) 2004; 65 Cung (10.1016/j.ejor.2007.08.007_bib24) 2000; 7 Fekete (10.1016/j.ejor.2007.08.007_bib26) 2007; 55 Caprara (10.1016/j.ejor.2007.08.007_bib12) 2002 Christofides (10.1016/j.ejor.2007.08.007_bib15) 1977; 25 Riehme (10.1016/j.ejor.2007.08.007_bib44) 1996; 91
References_xml	– reference: Karl-Heinz Borgwardt, Probabilistic analysis of the simplex method, in: Brunswick, 1988 (Ed.), Mathematical Developments arising from Linear Programming, Contemp. Math., vol. 114, pp. 21–34, American Mathematical Society, Providence, RI, 1990. – volume: 3 start-page: 66 year: 1982 end-page: 76 ident: bib16 article-title: On packing two-dimensional bins publication-title: SIAM Journal of Algebraic and Discrete Methods – volume: 8 start-page: 363 year: 2004 end-page: 379 ident: bib35 article-title: Models and bounds for two-dimensional level packing problems publication-title: Journal of Combinatorial Optimization – volume: 94 start-page: 257 year: 2003 end-page: 278 ident: bib36 article-title: Integer linear programming models for 2-staged two-dimensional knapsack problem publication-title: Mathematical Programming – reference: G.F. Cintra, Algoritmos para problemas de corte de guilhotina bidimensional, PhD thesis, Instituto de Matemática e Estatı´stica, São Paulo, 2004. – volume: 13 start-page: 94 year: 1965 end-page: 120 ident: bib29 article-title: Multistage cutting stock problems of two and more dimensions publication-title: Operations Research – volume: 47 start-page: 864 year: 2001 end-page: 879 ident: bib46 article-title: A nested decomposition approach to a 3-stage 2-dimensional cutting stock problem publication-title: Management Science – volume: vol. 2747 start-page: 398 year: 2003 end-page: 407 ident: bib25 article-title: Two dimensional packing: The power of rotation publication-title: Proceedings of the 28th International Symposium of Mathematical Foundations of Computer Science – reference: COIN-OR Linear Program Solver, An Open Source code for Solving Linear Programming Problems, – volume: 172 start-page: 814 year: 2006 end-page: 837 ident: bib10 article-title: A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces publication-title: European Journal of Operational Research – volume: 102 start-page: 519 year: 2005 end-page: 530 ident: bib45 article-title: The two-dimensional cutting stock problem revisited publication-title: Mathematical Programming – volume: 183 start-page: 1109 year: 2007 end-page: 1130 ident: bib48 article-title: An improved typology of cutting and packing problems publication-title: European Journal of Operational Research – reference: K. Jansen, R. van Stee, On strip packing with rotations, in: Proceedings of the ACM Symposium on Theory of Computing, 2005, pp. 755–761. – volume: 25 start-page: 645 year: 2000 end-page: 656 ident: bib34 article-title: A near-optimal solution to a two-dimensional cutting stock problem publication-title: Mathematics of Operations Research – volume: 2 start-page: 348 year: 1981 end-page: 368 ident: bib4 article-title: A publication-title: Journal of Algorithms – volume: 41 start-page: 1069 year: 1990 end-page: 1072 ident: bib7 article-title: OR-Library: Distributing test problems by electronic mail publication-title: Journal of the Operational Research Society – volume: 84 start-page: 599 year: 1995 end-page: 617 ident: bib3 article-title: An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems publication-title: European Journal of Operational Research – volume: vol. 3242 start-page: 642 year: 2004 end-page: 651 ident: bib42 article-title: An evolutionary algorithm for column generation in integer programming: an effective approach for 2d bin packing publication-title: Proceedings of Parallel Problem Solving from Nature – PPSN VIII – volume: 7 start-page: 185 year: 2000 end-page: 210 ident: bib24 article-title: Constrained two-dimensional cutting stock problems a best-first branch-and-bound algorithm publication-title: Int. Trans. Oper. Res. – volume: 15 start-page: 310 year: 2003 end-page: 319 ident: bib37 article-title: An exact approach to the strip-packing problem publication-title: INFORMS Journal on Computing – reference: . – volume: 9 start-page: 808 year: 1980 end-page: 826 ident: bib21 article-title: Performance bounds for level oriented two-dimensional packing algorithms publication-title: SIAM Journal on Computing – volume: 25 start-page: 30 year: 1977 end-page: 44 ident: bib15 article-title: An algorithm for two dimensional cutting problems publication-title: Operations Research – volume: vol. 2976 start-page: 359 year: 2004 end-page: 368 ident: bib38 article-title: Packing problems with orthogonal rotations publication-title: Proceedings of Latin American Theoretical INformatics – start-page: 320 year: 2002 end-page: 334 ident: bib12 article-title: An approximation scheme for the two-stage, two-dimensional bin packing problem publication-title: Proceedings of the Ninth Conference on Integer Programming and Combinatorial Optimization (IPCO’02) – reference: , 2003. – reference: G.F. Cintra, Y. Wakabayashi, Dynamic programming and column generation based approaches for two-dimensional guillotine cutting problems, in: Proceedings of WEA 2004: Workshop on Efficient and Experimental Algorithms, Lecture Notes in Computer Science, vol. 3059, 2004, pp. 175–190. – volume: 65 start-page: 101 year: 2004 end-page: 112 ident: bib40 article-title: The rectangular packing problem: Local optimum search methods based on block structures publication-title: Automation and Remote Control – volume: 58 start-page: 263 year: 1992 end-page: 271 ident: bib39 article-title: An and-or-graph approach for two-dimensional cutting problems publication-title: European Journal of Operational Research – volume: 30 start-page: 150 year: 2005 end-page: 172 ident: bib13 article-title: Fast approximation schemes for two-stage, two-dimensional bin packing publication-title: Mathematics of Operations Research – volume: 36 start-page: 297 year: 1985 end-page: 306 ident: bib5 article-title: Algorithms for unconstrained two-dimensional guillotine cutting publication-title: Journal of the Operational Research Society – volume: 183 start-page: 1328 year: 2007 end-page: 1332 ident: bib19 article-title: A note on the approximability of cutting stock problems publication-title: European Journal on Operations Research – volume: 25 start-page: 925 year: 1998 end-page: 940 ident: bib30 article-title: Exact algorithms for the guillotine strip cutting/packing problem publication-title: Computers & Operations Research – volume: 18 start-page: 131 year: 1996 end-page: 144 ident: bib47 article-title: Heuristics for the integer one-dimensional cutting stock problem: A computational study publication-title: OR Spektrum – volume: 11 start-page: 863 year: 1963 end-page: 888 ident: bib28 article-title: A linear programming approach to the cutting stock problem – Part II publication-title: Operations Research – start-page: 462 year: 1972 end-page: 469 ident: bib31 article-title: A recursive computational procedure for two-dimensional stock-cutting publication-title: IBM Journal of Research and Development – volume: 183 start-page: 1304 year: 2007 end-page: 1327 ident: bib43 article-title: Models and algorithms for three-stage two-dimensional bin packing publication-title: European Journal of Operational Research – volume: 44 start-page: 256 year: 1990 end-page: 266 ident: bib41 article-title: An improved version of Wang’s algorithm for two-dimensional cutting problems publication-title: European Journal of Operational Research – year: 2001 ident: bib23 article-title: Introduction to Algorithms – reference: A. Caprara, Packing 2-dimensional bins in harmony, in: Proceedings of the 43rd Symposium on Foundations of Computer Science, 2002, pp. 490–499. – reference: G.F. Cintra, Algoritmos hı´bridos para o problema de corte unidimensional, in: XXV Conferência Latinoamericana de Informática, Assunção, 1999. – reference: K. Jansen, G. Zhang, On rectangle packing: maximizing benefits, in: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, 2004, pp. 204–213. – volume: 91 start-page: 543 year: 1996 end-page: 552 ident: bib44 article-title: The solution of two-stage guillotine cutting stock problems having extremely varying order demands publication-title: European Journal of Operational Research – volume: 55 start-page: 569 year: 2007 end-page: 587 ident: bib26 article-title: An exact algorithm for higher-dimensional orthogonal packing publication-title: Operations Research – volume: 24 start-page: 179 year: 2002 end-page: 192 ident: bib2 article-title: A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems publication-title: OR Spektrum – reference: G. Belov, G. Scheithauer, Models with Variable Strip Widths for Two-dimensional Two-stage cutting, – volume: 32 start-page: 5 year: 2004 end-page: 14 ident: bib14 article-title: On the two-dimensional knapsack problem publication-title: Operations Research Letters – volume: 33 start-page: 49 year: 1985 end-page: 64 ident: bib6 article-title: An exact two-dimensional non-guillotine cutting tree search procedure publication-title: Operations Research – volume: 9 start-page: 849 year: 1961 end-page: 859 ident: bib27 article-title: A linear programming approach to the cutting stock problem publication-title: Operations Research – volume: 11 start-page: 378 year: 1984 end-page: 382 ident: bib1 article-title: New results on the average behavior of simplex algorithms publication-title: Bulletin of the American Mathematical Society (NS) – volume: 41 start-page: 1069 issue: 11 year: 1990 ident: 10.1016/j.ejor.2007.08.007_bib7 article-title: OR-Library: Distributing test problems by electronic mail publication-title: Journal of the Operational Research Society doi: 10.1057/jors.1990.166 – ident: 10.1016/j.ejor.2007.08.007_bib18 – volume: 44 start-page: 256 year: 1990 ident: 10.1016/j.ejor.2007.08.007_bib41 article-title: An improved version of Wang’s algorithm for two-dimensional cutting problems publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(90)90361-E – volume: 183 start-page: 1304 issue: 3 year: 2007 ident: 10.1016/j.ejor.2007.08.007_bib43 article-title: Models and algorithms for three-stage two-dimensional bin packing publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2005.11.064 – year: 2001 ident: 10.1016/j.ejor.2007.08.007_bib23 – volume: 8 start-page: 363 year: 2004 ident: 10.1016/j.ejor.2007.08.007_bib35 article-title: Models and bounds for two-dimensional level packing problems publication-title: Journal of Combinatorial Optimization doi: 10.1023/B:JOCO.0000038915.62826.79 – volume: 3 start-page: 66 year: 1982 ident: 10.1016/j.ejor.2007.08.007_bib16 article-title: On packing two-dimensional bins publication-title: SIAM Journal of Algebraic and Discrete Methods doi: 10.1137/0603007 – volume: 172 start-page: 814 year: 2006 ident: 10.1016/j.ejor.2007.08.007_bib10 article-title: A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2004.11.016 – volume: 30 start-page: 150 issue: 1 year: 2005 ident: 10.1016/j.ejor.2007.08.007_bib13 article-title: Fast approximation schemes for two-stage, two-dimensional bin packing publication-title: Mathematics of Operations Research doi: 10.1287/moor.1040.0112 – ident: 10.1016/j.ejor.2007.08.007_bib32 doi: 10.1145/1060590.1060702 – volume: 33 start-page: 49 issue: 1 year: 1985 ident: 10.1016/j.ejor.2007.08.007_bib6 article-title: An exact two-dimensional non-guillotine cutting tree search procedure publication-title: Operations Research doi: 10.1287/opre.33.1.49 – ident: 10.1016/j.ejor.2007.08.007_bib33 – volume: vol. 2976 start-page: 359 year: 2004 ident: 10.1016/j.ejor.2007.08.007_bib38 article-title: Packing problems with orthogonal rotations – volume: vol. 2747 start-page: 398 year: 2003 ident: 10.1016/j.ejor.2007.08.007_bib25 article-title: Two dimensional packing: The power of rotation – volume: 94 start-page: 257 year: 2003 ident: 10.1016/j.ejor.2007.08.007_bib36 article-title: Integer linear programming models for 2-staged two-dimensional knapsack problem publication-title: Mathematical Programming doi: 10.1007/s10107-002-0319-9 – volume: 18 start-page: 131 year: 1996 ident: 10.1016/j.ejor.2007.08.007_bib47 article-title: Heuristics for the integer one-dimensional cutting stock problem: A computational study publication-title: OR Spektrum doi: 10.1007/BF01539705 – volume: 11 start-page: 378 issue: 2 year: 1984 ident: 10.1016/j.ejor.2007.08.007_bib1 article-title: New results on the average behavior of simplex algorithms publication-title: Bulletin of the American Mathematical Society (NS) doi: 10.1090/S0273-0979-1984-15317-5 – volume: 65 start-page: 101 issue: 2 year: 2004 ident: 10.1016/j.ejor.2007.08.007_bib40 article-title: The rectangular packing problem: Local optimum search methods based on block structures publication-title: Automation and Remote Control doi: 10.1023/B:AURC.0000014721.38981.bb – start-page: 320 year: 2002 ident: 10.1016/j.ejor.2007.08.007_bib12 article-title: An approximation scheme for the two-stage, two-dimensional bin packing problem – volume: 25 start-page: 645 year: 2000 ident: 10.1016/j.ejor.2007.08.007_bib34 article-title: A near-optimal solution to a two-dimensional cutting stock problem publication-title: Mathematics of Operations Research doi: 10.1287/moor.25.4.645.12118 – volume: 91 start-page: 543 year: 1996 ident: 10.1016/j.ejor.2007.08.007_bib44 article-title: The solution of two-stage guillotine cutting stock problems having extremely varying order demands publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(95)00200-6 – volume: 11 start-page: 863 year: 1963 ident: 10.1016/j.ejor.2007.08.007_bib28 article-title: A linear programming approach to the cutting stock problem – Part II publication-title: Operations Research doi: 10.1287/opre.11.6.863 – volume: 58 start-page: 263 year: 1992 ident: 10.1016/j.ejor.2007.08.007_bib39 article-title: An and-or-graph approach for two-dimensional cutting problems publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(92)90212-R – volume: 2 start-page: 348 year: 1981 ident: 10.1016/j.ejor.2007.08.007_bib4 article-title: A 54 algorithm for two-dimensional packing publication-title: Journal of Algorithms doi: 10.1016/0196-6774(81)90034-1 – volume: 9 start-page: 849 year: 1961 ident: 10.1016/j.ejor.2007.08.007_bib27 article-title: A linear programming approach to the cutting stock problem publication-title: Operations Research doi: 10.1287/opre.9.6.849 – volume: 55 start-page: 569 issue: 3 year: 2007 ident: 10.1016/j.ejor.2007.08.007_bib26 article-title: An exact algorithm for higher-dimensional orthogonal packing publication-title: Operations Research doi: 10.1287/opre.1060.0369 – volume: 84 start-page: 599 year: 1995 ident: 10.1016/j.ejor.2007.08.007_bib3 article-title: An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(95)00026-M – ident: 10.1016/j.ejor.2007.08.007_bib17 – volume: 36 start-page: 297 issue: 4 year: 1985 ident: 10.1016/j.ejor.2007.08.007_bib5 article-title: Algorithms for unconstrained two-dimensional guillotine cutting publication-title: Journal of the Operational Research Society doi: 10.1057/jors.1985.51 – volume: 32 start-page: 5 year: 2004 ident: 10.1016/j.ejor.2007.08.007_bib14 article-title: On the two-dimensional knapsack problem publication-title: Operations Research Letters doi: 10.1016/S0167-6377(03)00057-9 – volume: 25 start-page: 925 issue: 11 year: 1998 ident: 10.1016/j.ejor.2007.08.007_bib30 article-title: Exact algorithms for the guillotine strip cutting/packing problem publication-title: Computers & Operations Research doi: 10.1016/S0305-0548(98)00008-2 – volume: 47 start-page: 864 year: 2001 ident: 10.1016/j.ejor.2007.08.007_bib46 article-title: A nested decomposition approach to a 3-stage 2-dimensional cutting stock problem publication-title: Management Science doi: 10.1287/mnsc.47.6.864.9809 – volume: 25 start-page: 30 year: 1977 ident: 10.1016/j.ejor.2007.08.007_bib15 article-title: An algorithm for two dimensional cutting problems publication-title: Operations Research doi: 10.1287/opre.25.1.30 – ident: 10.1016/j.ejor.2007.08.007_bib8 – volume: vol. 3242 start-page: 642 year: 2004 ident: 10.1016/j.ejor.2007.08.007_bib42 article-title: An evolutionary algorithm for column generation in integer programming: an effective approach for 2d bin packing – volume: 24 start-page: 179 issue: 2 year: 2002 ident: 10.1016/j.ejor.2007.08.007_bib2 article-title: A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems publication-title: OR Spektrum doi: 10.1007/s00291-002-0093-3 – volume: 183 start-page: 1109 issue: 3 year: 2007 ident: 10.1016/j.ejor.2007.08.007_bib48 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 – volume: 9 start-page: 808 year: 1980 ident: 10.1016/j.ejor.2007.08.007_bib21 article-title: Performance bounds for level oriented two-dimensional packing algorithms publication-title: SIAM Journal on Computing doi: 10.1137/0209062 – volume: 7 start-page: 185 issue: 3 year: 2000 ident: 10.1016/j.ejor.2007.08.007_bib24 article-title: Constrained two-dimensional cutting stock problems a best-first branch-and-bound algorithm publication-title: Int. Trans. Oper. Res. doi: 10.1111/j.1475-3995.2000.tb00194.x – ident: 10.1016/j.ejor.2007.08.007_bib9 doi: 10.1090/conm/114/1097863 – ident: 10.1016/j.ejor.2007.08.007_bib11 doi: 10.1109/SFCS.2002.1181973 – volume: 13 start-page: 94 year: 1965 ident: 10.1016/j.ejor.2007.08.007_bib29 article-title: Multistage cutting stock problems of two and more dimensions publication-title: Operations Research doi: 10.1287/opre.13.1.94 – volume: 183 start-page: 1328 issue: 3 year: 2007 ident: 10.1016/j.ejor.2007.08.007_bib19 article-title: A note on the approximability of cutting stock problems publication-title: European Journal on Operations Research doi: 10.1016/j.ejor.2005.09.053 – start-page: 462 year: 1972 ident: 10.1016/j.ejor.2007.08.007_bib31 article-title: A recursive computational procedure for two-dimensional stock-cutting publication-title: IBM Journal of Research and Development doi: 10.1147/rd.165.0462 – ident: 10.1016/j.ejor.2007.08.007_bib22 – ident: 10.1016/j.ejor.2007.08.007_bib20 – volume: 15 start-page: 310 issue: 3 year: 2003 ident: 10.1016/j.ejor.2007.08.007_bib37 article-title: An exact approach to the strip-packing problem publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.15.3.310.16082 – volume: 102 start-page: 519 issue: 3 year: 2005 ident: 10.1016/j.ejor.2007.08.007_bib45 article-title: The two-dimensional cutting stock problem revisited publication-title: Mathematical Programming doi: 10.1007/s10107-004-0548-1
SSID	ssj0001515
Score	2.3108823
Snippet	We investigate several two-dimensional guillotine cutting stock problems and their variants in which orthogonal rotations are allowed. We first present two...
SourceID	repec pascalfrancis crossref elsevier
SourceType	Index Database Enrichment Source Publisher
StartPage	61
SubjectTerms	Applied sciences Column generation Cutting stock Dynamic programming Exact sciences and technology Flows in networks. Combinatorial problems Guillotine cutting Operational research and scientific management Operational research. Management science Strip packing Two-dimensional packing
Title	Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
URI	https://dx.doi.org/10.1016/j.ejor.2007.08.007 http://econpapers.repec.org/article/eeeejores/v_3a191_3ay_3a2008_3ai_3a1_3ap_3a61-85.htm
Volume	191
WOSCitedRecordID	wos000257186700006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-6860 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: AIEXJ dateStart: 19950105 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bb9MwFLaqDSEQ4lJAlMvkB96qVG1cJ85jNm1aQVQIKq3jJXIch63r0qi3jV_G3-P4lnTVGPBAJUeVU8eVzmef45NzzofQeypFmGaceTLlxOunfe6x3KdellHSlzmhIs012UQ4HLLxOPrcaPx0uTDraVgU7Po6Kv-rqKEPhK1SZ_9B3NVDoQO-g9DhCmKH618JPp5-n8GJ_8xUWmgvr2Zepkr4m_IbbbEykc5g9IkL_epAMXeUbTg7X5jMdM0ws2ivtBchM4z1Lo7r0uU0CrWrFYqAWc5r4d7m4rfmLnTMnePRVhiqPNEHg-HoS6xd9J061PjT4DT-Fp_o_qNO7Y89iT_G-_Fp_PV4UCsQ6B_Hym2mN_eOdf46dwZTeX0m29L42KxBsLENkjD0fN9keFZ7tqH4ugFOswOb0u5Ol9NbtYRxWEw6cjKb2yqWKqI2rHWiiwPYUpVVAKPfJRELVHGDXT-kEdtBu_HgcPyhMgKUnahfYNk_b_O1TGjh9ry_s4kelXwBKzU3FCtwfJrLUooN-2f0FD22BxccG8A9Qw1ZNNETe4jBVkUsmui-S6WAu44yxN1uoocb9S-fo6saqxiwirewii1WscYqBthhjVVssYodVrHGKrZYxRtY1YMMVnGN1RdodHQ4Ojj2LBOIJ2g3WHq8l2Yko5KnPqE87QrJqU-CKOOBjFQFJV_knAVdnkcc1JRkPIqEBMuViKDHOHmJdopZIV8hLEJCSMDBzGVwVsl7PMv7THDaF2EQBjJvoZ4TRSJslXxF1jJNXDjkJFHiU_StYaIYXLthC7WrMaWpEXPnr6mTcGKtXGO9JgDPO8ft3YBDNZXDYgvta3xUNyR84CFykawTwmHJwPUHNM08S_i56oRWQgt6CaPJ2fLy9Z9meYMe1Mv2LdpZzlfyHbon1svzxXzPLoNfjwnsLg
linkProvider	Elsevier
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=Algorithms+for+two-dimensional+cutting+stock+and+strip+packing+problems+using+dynamic+programming+and+column+generation&rft.jtitle=European+journal+of+operational+research&rft.au=CINTRA%2C+G.+F&rft.au=MIYAZAWA%2C+F.+K&rft.au=WAKABAYASHI%2C+Y&rft.au=XAVIER%2C+E.+C&rft.date=2008-11-16&rft.pub=Elsevier&rft.issn=0377-2217&rft.volume=191&rft.issue=1&rft.spage=61&rft.epage=85&rft_id=info:doi/10.1016%2Fj.ejor.2007.08.007&rft.externalDBID=n%2Fa&rft.externalDocID=20398615
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