Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints
•A new model in integer programming for the forest harvest scheduling is proposed.•The model mitigates forest fragmentation caused by harvestings.•A branch-and-cut is proposed to solve the model.•The results proved to be very satisfactory from a practical point of view. Integrating forest fragmentat...
Uloženo v:
| Vydáno v: | European journal of operational research Ročník 265; číslo 2; s. 723 - 734 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier B.V
01.03.2018
|
| Témata: | |
| ISSN: | 0377-2217, 1872-6860 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | •A new model in integer programming for the forest harvest scheduling is proposed.•The model mitigates forest fragmentation caused by harvestings.•A branch-and-cut is proposed to solve the model.•The results proved to be very satisfactory from a practical point of view.
Integrating forest fragmentation into forest harvest scheduling problems adds substantial complexity to the models and solution techniques. Forest fragmentation leads to shrinking of the core habitat area and to weakening of the inter-habitat connections. In this work, we study forest harvest scheduling problems with constraints on the clearcut area and constraints on the core area. We propose a mixed integer programming formulation where constraints on the clearcut area are the so-called cover constraints while constraints on the core area are new in the literature as far as we know. As the number of constraints can be exponentially large, the model is solved by branch-and-cut, where the spatial constraints are generated only as necessary or not before they are needed. Branch-and-cut was tested on real and hypothetical forest data sets ranging from 45 to 1363 stands and temporal horizons ranging from three to seven periods were employed. Results show that the solutions obtained by the proposed approach are within or slightly above 1% of the optimal solution within three hours at the most. |
|---|---|
| AbstractList | •A new model in integer programming for the forest harvest scheduling is proposed.•The model mitigates forest fragmentation caused by harvestings.•A branch-and-cut is proposed to solve the model.•The results proved to be very satisfactory from a practical point of view.
Integrating forest fragmentation into forest harvest scheduling problems adds substantial complexity to the models and solution techniques. Forest fragmentation leads to shrinking of the core habitat area and to weakening of the inter-habitat connections. In this work, we study forest harvest scheduling problems with constraints on the clearcut area and constraints on the core area. We propose a mixed integer programming formulation where constraints on the clearcut area are the so-called cover constraints while constraints on the core area are new in the literature as far as we know. As the number of constraints can be exponentially large, the model is solved by branch-and-cut, where the spatial constraints are generated only as necessary or not before they are needed. Branch-and-cut was tested on real and hypothetical forest data sets ranging from 45 to 1363 stands and temporal horizons ranging from three to seven periods were employed. Results show that the solutions obtained by the proposed approach are within or slightly above 1% of the optimal solution within three hours at the most. |
| Author | Constantino, Miguel Martins, Isabel |
| Author_xml | – sequence: 1 givenname: Miguel surname: Constantino fullname: Constantino, Miguel email: miguel.constantino@fc.ul.pt organization: Centro de Matemática, Aplicações Fundamentais e Investigação Operacional, Faculdade de Ciências, Universidade de Lisboa, Portugal – sequence: 2 givenname: Isabel surname: Martins fullname: Martins, Isabel email: isabelinha@isa.ulisboa.pt organization: Centro de Matemática, Aplicações Fundamentais e Investigação Operacional, Instituto Superior de Agronomia, Universidade de Lisboa, Portugal |
| BookMark | eNp9kE1LAzEQhoNUsK3-AU_5A1vzsZtNwYsWv6DgRa-GdHbWzbJmJUkL_nuz1JOHwgvvXJ5h5lmQmR89EnLN2Yozrm76FfZjWAnG6xXLUeyMzLmuRaG0YjMyZ7KuCyF4fUEWMfaMMV7xak4-7oP10BXWNwXsE23HQFOHU2NMtLPhMHWEDpv94Pwnjftdj5BoGikMaMNEZZpCJqgNaPPkYwrW-RQvyXlrh4hXf70k748Pb5vnYvv69LK52xYgpUhF03JsYN1aWVWysRbqplSKgSyrspacKwF6V2rYWV3ptpTlWnBhdQtMsBpblEuij3shjDEGbA24ZJMb_XTIYDgzkyfTm8mTmTwZlqNYRsU_9Du4Lxt-TkO3RwjzUweHwURw6AEbF7Ic04zuFP4Lua6FpA |
| CitedBy_id | crossref_primary_10_1111_itor_13183 crossref_primary_10_1016_j_cor_2019_104836 crossref_primary_10_1007_s12597_025_00949_3 crossref_primary_10_1111_poms_13967 crossref_primary_10_1016_j_ejor_2021_12_012 crossref_primary_10_3389_ffgc_2024_1368608 crossref_primary_10_1016_j_ejor_2019_10_029 crossref_primary_10_3390_f13040525 crossref_primary_10_1016_j_ejor_2017_12_022 crossref_primary_10_3390_land12010015 crossref_primary_10_1007_s43069_021_00069_w crossref_primary_10_3389_ffgc_2023_1177698 |
| Cites_doi | 10.1016/S0966-8349(98)00031-X 10.1016/j.ecolmodel.2004.07.009 10.1139/x98-076 10.1111/j.1523-1739.1991.tb00384.x 10.1093/forestscience/48.4.631 10.1016/j.ejor.2003.07.021 10.1287/opre.1040.0169 10.1093/forestscience/52.1.93 10.1287/opre.2013.1183 10.1016/j.foreco.2007.09.033 10.1007/s10589-010-9347-1 10.1139/x00-103 10.1016/j.landurbplan.2007.03.005 10.1287/opre.1070.0472 10.1093/forestscience/48.3.608 10.1093/forestscience/40.1.177 10.1111/1475-3995.00424 10.1016/S0377-2217(97)00017-9 10.1007/s11750-012-0260-x 10.1007/BF02275261 10.1093/forestscience/54.3.367 10.1139/x94-167 10.5849/forsci.12-051 10.1016/j.ejor.2013.01.020 10.5849/forsci.11-040 10.1007/s10479-009-0517-4 10.1093/forestscience/55.2.149 10.1093/forestscience/49.4.608 10.1093/forestscience/49.5.738 10.1111/itor.12003 10.14214/sf.545 10.1016/j.foreco.2005.03.059 10.1139/x95-198 10.1016/S0378-1127(01)00664-8 10.1139/X07-033 |
| ContentType | Journal Article |
| Copyright | 2017 Elsevier B.V. |
| Copyright_xml | – notice: 2017 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.ejor.2017.07.060 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1872-6860 |
| EndPage | 734 |
| ExternalDocumentID | 10_1016_j_ejor_2017_07_060 S0377221717307038 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 4.4 457 4G. 5GY 5VS 6OB 7-5 71M 8P~ 9JN 9JO AAAKF AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AARIN AAXUO AAYFN ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO ABYKQ ACAZW ACDAQ ACGFO ACGFS ACIWK ACNCT ACRLP ACZNC ADBBV ADEZE ADGUI AEBSH AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR AXJTR BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 RIG ROL RPZ RXW SCC SDF SDG SDP SDS SES SPC SPCBC SSB SSD SSV SSW SSZ T5K TAE TN5 U5U XPP ZMT ~02 ~G- 1OL 29G 41~ 9DU AAAKG AAQXK AATTM AAXKI AAYWO AAYXX ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADIYS ADJOM ADMUD ADNMO ADXHL AEIPS AEUPX AFFNX AFJKZ AFPUW AGQPQ AI. AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS FEDTE FGOYB HVGLF HZ~ R2- SEW VH1 WUQ ~HD |
| ID | FETCH-LOGICAL-c332t-df1edc9fa3553daac7d4660c3454731162c8b48cba858f4349212a8fc0207efe3 |
| ISICitedReferencesCount | 9 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000416396200026&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 | Sat Nov 29 05:34:32 EST 2025 Tue Nov 18 21:07:20 EST 2025 Fri Feb 23 02:27:38 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | OR in natural resources Integer programming Forest management Cutting plane |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c332t-df1edc9fa3553daac7d4660c3454731162c8b48cba858f4349212a8fc0207efe3 |
| PageCount | 12 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_ejor_2017_07_060 crossref_primary_10_1016_j_ejor_2017_07_060 elsevier_sciencedirect_doi_10_1016_j_ejor_2017_07_060 |
| PublicationCentury | 2000 |
| PublicationDate | 2018-03-01 |
| PublicationDateYYYYMMDD | 2018-03-01 |
| PublicationDate_xml | – month: 03 year: 2018 text: 2018-03-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | European journal of operational research |
| PublicationYear | 2018 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Yoshimoto, Brodie (bib0001) 1994; 24 Könnyũ, Tóth (bib0020) 2013; 228 Martins, Ye, Constantino, Fonseca, Cadima (bib0026) 2014; 28 ILOG (2012). ILOG CPLEX 12.5 – User’s manual. Martins, Alvelos, Constantino (bib0021) 2012; 51 Neto, Constantino, Martins, Pedroso (bib0030) 2013; 20 Williams, ReVelle (bib0045) 1998; 104 Neto, Constantino, Martins, Pedroso (bib0031) 2016 Snyder, ReVelle (bib0039) 1997; 5 Wei, Hoganson (bib0044) 2008; 54 Wei, Hoganson (bib0043) 2006; 37 Martins, Constantino, Borges (bib0025) 2005 Moreira, Rodriguez, Caixeta-Filho (bib0029) 2013; 59 Öhman, Wikström (bib0034) 2008; 255 Caro, Constantino, Martins, Weintraub (bib0005) 2003; 49 Saura, Pascual-Hortal (bib0038) 2007; 83 Tóth, McDill, George (bib0040) 2012; 4 Tóth, McDill, George (bib0041) 2013; 59 Öhman, Eriksson (bib0018) 1998; 28 McDill, Rebain, Braze (bib0027) 2002; 48 Öhman, Lämȧs (bib0033) 2005; 212 Martins, Constantino, Borges (bib0023) 2004 Gondran, Minoux (bib0011) 1984 Goycoolea, Murray, Vielma, Weintraub (bib0013) 2009; 55 Harris (bib0014) 1984 Bettinger, Graetz, Boston, Sessions, Chung (bib0003) 2002; 36 Carvajal, Constantino, Goycoolea, Vielma, Weintraub (bib0006) 2013; 61 Hof, Bevers, Joyce, Kent (bib0015) 1994; 40 Wolsey (bib0046) 1998 Baskent, Jordan (bib0002) 1995; 25 Rebain, McDill (bib0036) 2003; 49 Hoganson, Wei, Hokans (bib0016) 2004 Öhman (bib0032) 2000; 30 Falcão, Borges (bib0009) 2002; 48 Goycoolea, Murray, Barahona, Epstein, Weintraub (bib0012) 2005; 53 Saunders, Hobbs, Margules (bib0037) 1991; 5 Zhang, Constantino, Falcão (bib0047) 2011; 190 . Constantino, Martins, Borges (bib0007) 2008; 56 McGarigal, K., Cushman, S. A., & Ene, E. (2012). FRAGSTATS v4: Spatial pattern analysis program for categorical and continuous maps, computer software program produced by the authors at the university of Massachusetts, Amherst. Available at the following web site Bettinger, Lennette, Johnson, Spies (bib0004) 2005; 182 Kurtilla, Pukkala, Loikkanen (bib0019) 2002; 166 Tóth, McDill, Rebain (bib0042) 2006; 52 Franklin, Forman (bib0010) 1987; 1 Martins, Constantino, Borges (bib0022) 1999 Elf, Gutwenger, Jünger, Rinaldi (bib0008) 2001 Rebain, McDill (bib0035) 2003; 10 Martins, Constantino, Borges (bib0024) 2005; 161 Wei (10.1016/j.ejor.2017.07.060_bib0044) 2008; 54 Falcão (10.1016/j.ejor.2017.07.060_bib0009) 2002; 48 Goycoolea (10.1016/j.ejor.2017.07.060_bib0013) 2009; 55 Gondran (10.1016/j.ejor.2017.07.060_bib0011) 1984 Martins (10.1016/j.ejor.2017.07.060_sbref0021) 1999 Tóth (10.1016/j.ejor.2017.07.060_bib0041) 2013; 59 Martins (10.1016/j.ejor.2017.07.060_bib0026) 2014; 28 10.1016/j.ejor.2017.07.060_bib0028 Wei (10.1016/j.ejor.2017.07.060_bib0043) 2006; 37 Neto (10.1016/j.ejor.2017.07.060_bib0030) 2013; 20 Tóth (10.1016/j.ejor.2017.07.060_bib0042) 2006; 52 Harris (10.1016/j.ejor.2017.07.060_bib0014) 1984 Moreira (10.1016/j.ejor.2017.07.060_bib0029) 2013; 59 Goycoolea (10.1016/j.ejor.2017.07.060_bib0012) 2005; 53 Saura (10.1016/j.ejor.2017.07.060_bib0038) 2007; 83 Zhang (10.1016/j.ejor.2017.07.060_bib0047) 2011; 190 Neto (10.1016/j.ejor.2017.07.060_bib0031) 2016 Hoganson (10.1016/j.ejor.2017.07.060_bib0016) 2004 Saunders (10.1016/j.ejor.2017.07.060_bib0037) 1991; 5 Kurtilla (10.1016/j.ejor.2017.07.060_bib0019) 2002; 166 Carvajal (10.1016/j.ejor.2017.07.060_bib0006) 2013; 61 Caro (10.1016/j.ejor.2017.07.060_bib0005) 2003; 49 Baskent (10.1016/j.ejor.2017.07.060_bib0002) 1995; 25 Bettinger (10.1016/j.ejor.2017.07.060_bib0004) 2005; 182 Martins (10.1016/j.ejor.2017.07.060_bib0024) 2005; 161 Bettinger (10.1016/j.ejor.2017.07.060_bib0003) 2002; 36 10.1016/j.ejor.2017.07.060_bib0017 Martins (10.1016/j.ejor.2017.07.060_bib0021) 2012; 51 McDill (10.1016/j.ejor.2017.07.060_bib0027) 2002; 48 Martins (10.1016/j.ejor.2017.07.060_sbref0022) 2004 Constantino (10.1016/j.ejor.2017.07.060_bib0007) 2008; 56 Öhman (10.1016/j.ejor.2017.07.060_bib0034) 2008; 255 Williams (10.1016/j.ejor.2017.07.060_bib0045) 1998; 104 Hof (10.1016/j.ejor.2017.07.060_bib0015) 1994; 40 Öhman (10.1016/j.ejor.2017.07.060_bib0032) 2000; 30 Elf (10.1016/j.ejor.2017.07.060_bib0008) 2001 Rebain (10.1016/j.ejor.2017.07.060_bib0035) 2003; 10 Franklin (10.1016/j.ejor.2017.07.060_bib0010) 1987; 1 Öhman (10.1016/j.ejor.2017.07.060_bib0018) 1998; 28 Tóth (10.1016/j.ejor.2017.07.060_bib0040) 2012; 4 Rebain (10.1016/j.ejor.2017.07.060_bib0036) 2003; 49 Yoshimoto (10.1016/j.ejor.2017.07.060_bib0001) 1994; 24 Könnyũ (10.1016/j.ejor.2017.07.060_bib0020) 2013; 228 Öhman (10.1016/j.ejor.2017.07.060_bib0033) 2005; 212 Snyder (10.1016/j.ejor.2017.07.060_bib0039) 1997; 5 Martins (10.1016/j.ejor.2017.07.060_sbref0024) 2005 Wolsey (10.1016/j.ejor.2017.07.060_bib0046) 1998 |
| References_xml | – volume: 25 start-page: 1830 year: 1995 end-page: 1849 ident: bib0002 article-title: Characterizing spatial structure of forest landscapes publication-title: Canadian Journal of Forest Research – volume: 212 start-page: 346 year: 2005 end-page: 357 ident: bib0033 article-title: Reducing forest fragmentation in long-term forest planning by using the shape index publication-title: Forest Ecology and Management – volume: 182 start-page: 25 year: 2005 end-page: 48 ident: bib0004 article-title: A hierarchical spatial framework for forest landscape planning publication-title: Ecological Modelling – volume: 228 start-page: 236 year: 2013 end-page: 248 ident: bib0020 article-title: A cutting plane method for solving harvest scheduling models with area restrictions publication-title: European Journal of Operations Research – volume: 10 start-page: 499 year: 2003 end-page: 513 ident: bib0035 article-title: Can mature patch constraints mitigate the fragmenting effect of harvest opening size restrictions? publication-title: International Transactions in Operational Research – year: 1984 ident: bib0011 article-title: Graphs and algorithms – year: 2016 ident: bib0031 article-title: Forest harvest scheduling with clearcut and core area constraints publication-title: Annals of Operations Research – volume: 49 start-page: 608 year: 2003 end-page: 618 ident: bib0036 article-title: A mixed-integer formulation of the minimum patch size problem publication-title: Forest Science – volume: 24 start-page: 1277 year: 1994 end-page: 1288 ident: bib0001 article-title: Comparative analysis of algorithms to generate adjacency constraints publication-title: Canadian Journal of Forest Research – volume: 56 start-page: 542 year: 2008 end-page: 551 ident: bib0007 article-title: A new mixed-integer programming model for harvest scheduling subject to maximum area restrictions publication-title: Operations Research – reference: ILOG (2012). ILOG CPLEX 12.5 – User’s manual. – reference: McGarigal, K., Cushman, S. A., & Ene, E. (2012). FRAGSTATS v4: Spatial pattern analysis program for categorical and continuous maps, computer software program produced by the authors at the university of Massachusetts, Amherst. Available at the following web site: – year: 1999 ident: bib0022 article-title: Forest management models with spatial structure constraints – volume: 161 start-page: 478 year: 2005 end-page: 498 ident: bib0024 article-title: A column generation approach for solving a non-temporal forest harvest model with spatial structure constraints publication-title: European Journal of Operational Research – volume: 83 start-page: 91 year: 2007 end-page: 103 ident: bib0038 article-title: A new habitat availability index to integrate connectivity in landscape conservation planning: comparison with existing indices and application to a case study publication-title: Landscape and Urban Planning – volume: 61 start-page: 824 year: 2013 end-page: 836 ident: bib0006 article-title: Imposing connectivity constraints in forest harvest scheduling publication-title: Operations Research – year: 2004 ident: bib0023 article-title: A branch-and-cut approach for forest management models with spatial constraints – volume: 1 start-page: 5 year: 1987 end-page: 18 ident: bib0010 article-title: Creating landscape patterns by forest cutting, ecological consequences and principles publication-title: Landscape Ecology – volume: 51 start-page: 363 year: 2012 end-page: 385 ident: bib0021 article-title: A branch-and-price approach for harvest scheduling subject to maximum area restrictions publication-title: Computational Optimization and Applications – volume: 59 start-page: 157 year: 2013 end-page: 176 ident: bib0041 article-title: Testing the use of lazy constraints in solving area-based adjacency formulations of harvest scheduling models publication-title: Forest Science – year: 1998 ident: bib0046 article-title: Integer programming – volume: 40 start-page: 177 year: 1994 end-page: 191 ident: bib0015 article-title: An integer programming approach for spatially and temporally optimizing wildlife populations. publication-title: Forest Science – year: 2001 ident: bib0008 article-title: Branch-and-cut algorithms for combinatorial optimization and their implementation in ABACUS publication-title: Computational combinatorial optimization – Optimal or probably near-optimal solution – volume: 28 start-page: 1032 year: 1998 end-page: 1039 ident: bib0018 article-title: The core area concept in forming contiguous areas for long term forest planning publication-title: Canadian Journal of Forest Research – volume: 5 start-page: 165 year: 1997 end-page: 180 ident: bib0039 article-title: Multiobjective grid packing model: An application in forest management publication-title: Location Science – volume: 166 start-page: 245 year: 2002 end-page: 260 ident: bib0019 article-title: The performance of alternative spatial objective types in forest planning calculations: A case for flying squirrel and moose publication-title: Forest Ecology and Management – volume: 30 start-page: 1817 year: 2000 end-page: 1823 ident: bib0032 article-title: Creating continuous areas of old forest in long term forest planning publication-title: Canadian Journal of Forest Research – volume: 36 start-page: 561 year: 2002 end-page: 584 ident: bib0003 article-title: Eight heuristic planning techniques applied to three increasingly difficult wildlife planning problems publication-title: Silva Fennica – year: 2005 ident: bib0025 article-title: A network flow model for forest management problems with spatial constraints – volume: 59 start-page: 661 year: 2013 end-page: 669 ident: bib0029 article-title: An optimization model to integrate forest plantations and connecting corridors publication-title: Forest Science – volume: 54 start-page: 367 year: 2008 end-page: 380 ident: bib0044 article-title: Tests of a dynamic programming-based heuristic for scheduling forest core area production over large landscapes publication-title: Forest Science – volume: 255 start-page: 440 year: 2008 end-page: 446 ident: bib0034 article-title: Incorporating aspects of habitat fragmentation into long-term forest planning using mixed integer programming publication-title: Forest Ecology and Management – volume: 5 start-page: 18 year: 1991 end-page: 32 ident: bib0037 article-title: Biological consequences of ecosystem fragmentation: A review publication-title: Conservation Biology – reference: . – volume: 20 start-page: 689 year: 2013 end-page: 709 ident: bib0030 article-title: A branch-and-bound procedure for forest harvest scheduling problems addressing aspects of habitat availability publication-title: International Transactions in Operational Research – volume: 52 start-page: 93 year: 2006 end-page: 107 ident: bib0042 article-title: Finding the efficient of a bi-criteria, spatially-explicit, harvest scheduling problem publication-title: Forest Science – year: 1984 ident: bib0014 article-title: The fragmented forest: Island biogeography theory and the preservation of biotic diversity – volume: 37 start-page: 1924 year: 2006 end-page: 1932 ident: bib0043 article-title: Scheduling forest core area production using mixed integer programming publication-title: Canadian Journal of Forest Research – volume: 28 start-page: 343 year: 2014 end-page: 362 ident: bib0026 article-title: Modeling target volume flow in forest harvest scheduling subject to maximum area restrictions publication-title: TOP – volume: 53 start-page: 90 year: 2005 end-page: 500 ident: bib0012 article-title: Harvest scheduling subject to maximum area restrictions: Exploring exact approaches publication-title: Operations Research – volume: 4 start-page: 27 year: 2012 end-page: 49 ident: bib0040 article-title: A strengthening procedure for the path formulation of the area-based adjacency problem in harvest scheduling models publication-title: Mathematical and Computational Forestry & Natural-Resource Sciences – volume: 49 start-page: 738 year: 2003 end-page: 751 ident: bib0005 article-title: A 2-opt tabu search procedure for the multiperiod forest harvesting problem with adjacency, greenup, old grwoth, and even flow constraints publication-title: Forest Science – volume: 48 start-page: 631 year: 2002 end-page: 642 ident: bib0027 article-title: Harvest scheduling with area-based adjacency constraints publication-title: Forest Science – volume: 48 start-page: 608 year: 2002 end-page: 621 ident: bib0009 article-title: Combining random and systematic search heuristic procedures for solving spatially constrained forest management scheduling models publication-title: Forest Science – volume: 55 start-page: 149 year: 2009 end-page: 165 ident: bib0013 article-title: Evaluating approaches for solving the area restricted model in harvest scheduling publication-title: Forest Science – year: 2004 ident: bib0016 article-title: Integrating spatial objectives into forest plans for Minnesota national forests. publication-title: Proceedings of the 2003 symposium on systems analysis in forest resources October 7–9 Stevenson WA, USDA forest service, Rocky mountain research station – volume: 190 start-page: 41 year: 2011 end-page: 55 ident: bib0047 article-title: Modeling forest core area with integer programming publication-title: Annals of Operations Research – volume: 104 start-page: 497 year: 1998 end-page: 509 ident: bib0045 article-title: Reserve assemblage of critical areas: A zero-one programming approach publication-title: European Journal of Operations Research – year: 2001 ident: 10.1016/j.ejor.2017.07.060_bib0008 article-title: Branch-and-cut algorithms for combinatorial optimization and their implementation in ABACUS – volume: 5 start-page: 165 issue: 3 year: 1997 ident: 10.1016/j.ejor.2017.07.060_bib0039 article-title: Multiobjective grid packing model: An application in forest management publication-title: Location Science doi: 10.1016/S0966-8349(98)00031-X – volume: 182 start-page: 25 year: 2005 ident: 10.1016/j.ejor.2017.07.060_bib0004 article-title: A hierarchical spatial framework for forest landscape planning publication-title: Ecological Modelling doi: 10.1016/j.ecolmodel.2004.07.009 – volume: 28 start-page: 1032 issue: 7 year: 1998 ident: 10.1016/j.ejor.2017.07.060_bib0018 article-title: The core area concept in forming contiguous areas for long term forest planning publication-title: Canadian Journal of Forest Research doi: 10.1139/x98-076 – volume: 5 start-page: 18 year: 1991 ident: 10.1016/j.ejor.2017.07.060_bib0037 article-title: Biological consequences of ecosystem fragmentation: A review publication-title: Conservation Biology doi: 10.1111/j.1523-1739.1991.tb00384.x – volume: 48 start-page: 631 issue: 4 year: 2002 ident: 10.1016/j.ejor.2017.07.060_bib0027 article-title: Harvest scheduling with area-based adjacency constraints publication-title: Forest Science doi: 10.1093/forestscience/48.4.631 – volume: 161 start-page: 478 issue: 2 year: 2005 ident: 10.1016/j.ejor.2017.07.060_bib0024 article-title: A column generation approach for solving a non-temporal forest harvest model with spatial structure constraints publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2003.07.021 – volume: 53 start-page: 90 issue: 3 year: 2005 ident: 10.1016/j.ejor.2017.07.060_bib0012 article-title: Harvest scheduling subject to maximum area restrictions: Exploring exact approaches publication-title: Operations Research doi: 10.1287/opre.1040.0169 – volume: 52 start-page: 93 issue: 1 year: 2006 ident: 10.1016/j.ejor.2017.07.060_bib0042 article-title: Finding the efficient of a bi-criteria, spatially-explicit, harvest scheduling problem publication-title: Forest Science doi: 10.1093/forestscience/52.1.93 – year: 2004 ident: 10.1016/j.ejor.2017.07.060_bib0016 article-title: Integrating spatial objectives into forest plans for Minnesota national forests. – volume: 61 start-page: 824 issue: 4 year: 2013 ident: 10.1016/j.ejor.2017.07.060_bib0006 article-title: Imposing connectivity constraints in forest harvest scheduling publication-title: Operations Research doi: 10.1287/opre.2013.1183 – volume: 255 start-page: 440 year: 2008 ident: 10.1016/j.ejor.2017.07.060_bib0034 article-title: Incorporating aspects of habitat fragmentation into long-term forest planning using mixed integer programming publication-title: Forest Ecology and Management doi: 10.1016/j.foreco.2007.09.033 – volume: 51 start-page: 363 year: 2012 ident: 10.1016/j.ejor.2017.07.060_bib0021 article-title: A branch-and-price approach for harvest scheduling subject to maximum area restrictions publication-title: Computational Optimization and Applications doi: 10.1007/s10589-010-9347-1 – volume: 30 start-page: 1817 issue: 11 year: 2000 ident: 10.1016/j.ejor.2017.07.060_bib0032 article-title: Creating continuous areas of old forest in long term forest planning publication-title: Canadian Journal of Forest Research doi: 10.1139/x00-103 – volume: 83 start-page: 91 issue: 2–3 year: 2007 ident: 10.1016/j.ejor.2017.07.060_bib0038 article-title: A new habitat availability index to integrate connectivity in landscape conservation planning: comparison with existing indices and application to a case study publication-title: Landscape and Urban Planning doi: 10.1016/j.landurbplan.2007.03.005 – volume: 56 start-page: 542 issue: 3 year: 2008 ident: 10.1016/j.ejor.2017.07.060_bib0007 article-title: A new mixed-integer programming model for harvest scheduling subject to maximum area restrictions publication-title: Operations Research doi: 10.1287/opre.1070.0472 – volume: 48 start-page: 608 issue: 3 year: 2002 ident: 10.1016/j.ejor.2017.07.060_bib0009 article-title: Combining random and systematic search heuristic procedures for solving spatially constrained forest management scheduling models publication-title: Forest Science doi: 10.1093/forestscience/48.3.608 – volume: 4 start-page: 27 issue: 1 year: 2012 ident: 10.1016/j.ejor.2017.07.060_bib0040 article-title: A strengthening procedure for the path formulation of the area-based adjacency problem in harvest scheduling models publication-title: Mathematical and Computational Forestry & Natural-Resource Sciences – volume: 40 start-page: 177 issue: 1 year: 1994 ident: 10.1016/j.ejor.2017.07.060_bib0015 article-title: An integer programming approach for spatially and temporally optimizing wildlife populations. publication-title: Forest Science doi: 10.1093/forestscience/40.1.177 – volume: 10 start-page: 499 issue: 5 year: 2003 ident: 10.1016/j.ejor.2017.07.060_bib0035 article-title: Can mature patch constraints mitigate the fragmenting effect of harvest opening size restrictions? publication-title: International Transactions in Operational Research doi: 10.1111/1475-3995.00424 – year: 2016 ident: 10.1016/j.ejor.2017.07.060_bib0031 article-title: Forest harvest scheduling with clearcut and core area constraints publication-title: Annals of Operations Research – volume: 104 start-page: 497 issue: 3 year: 1998 ident: 10.1016/j.ejor.2017.07.060_bib0045 article-title: Reserve assemblage of critical areas: A zero-one programming approach publication-title: European Journal of Operations Research doi: 10.1016/S0377-2217(97)00017-9 – year: 1984 ident: 10.1016/j.ejor.2017.07.060_bib0014 – ident: 10.1016/j.ejor.2017.07.060_bib0028 – year: 2004 ident: 10.1016/j.ejor.2017.07.060_sbref0022 – year: 2005 ident: 10.1016/j.ejor.2017.07.060_sbref0024 – volume: 28 start-page: 343 year: 2014 ident: 10.1016/j.ejor.2017.07.060_bib0026 article-title: Modeling target volume flow in forest harvest scheduling subject to maximum area restrictions publication-title: TOP doi: 10.1007/s11750-012-0260-x – volume: 1 start-page: 5 issue: 1 year: 1987 ident: 10.1016/j.ejor.2017.07.060_bib0010 article-title: Creating landscape patterns by forest cutting, ecological consequences and principles publication-title: Landscape Ecology doi: 10.1007/BF02275261 – volume: 54 start-page: 367 issue: 3 year: 2008 ident: 10.1016/j.ejor.2017.07.060_bib0044 article-title: Tests of a dynamic programming-based heuristic for scheduling forest core area production over large landscapes publication-title: Forest Science doi: 10.1093/forestscience/54.3.367 – volume: 24 start-page: 1277 year: 1994 ident: 10.1016/j.ejor.2017.07.060_bib0001 article-title: Comparative analysis of algorithms to generate adjacency constraints publication-title: Canadian Journal of Forest Research doi: 10.1139/x94-167 – volume: 59 start-page: 661 issue: 6 year: 2013 ident: 10.1016/j.ejor.2017.07.060_bib0029 article-title: An optimization model to integrate forest plantations and connecting corridors publication-title: Forest Science doi: 10.5849/forsci.12-051 – volume: 228 start-page: 236 issue: 1 year: 2013 ident: 10.1016/j.ejor.2017.07.060_bib0020 article-title: A cutting plane method for solving harvest scheduling models with area restrictions publication-title: European Journal of Operations Research doi: 10.1016/j.ejor.2013.01.020 – volume: 59 start-page: 157 issue: 2 year: 2013 ident: 10.1016/j.ejor.2017.07.060_bib0041 article-title: Testing the use of lazy constraints in solving area-based adjacency formulations of harvest scheduling models publication-title: Forest Science doi: 10.5849/forsci.11-040 – year: 1984 ident: 10.1016/j.ejor.2017.07.060_bib0011 – volume: 190 start-page: 41 year: 2011 ident: 10.1016/j.ejor.2017.07.060_bib0047 article-title: Modeling forest core area with integer programming publication-title: Annals of Operations Research doi: 10.1007/s10479-009-0517-4 – volume: 55 start-page: 149 issue: 2 year: 2009 ident: 10.1016/j.ejor.2017.07.060_bib0013 article-title: Evaluating approaches for solving the area restricted model in harvest scheduling publication-title: Forest Science doi: 10.1093/forestscience/55.2.149 – volume: 49 start-page: 608 issue: 4 year: 2003 ident: 10.1016/j.ejor.2017.07.060_bib0036 article-title: A mixed-integer formulation of the minimum patch size problem publication-title: Forest Science doi: 10.1093/forestscience/49.4.608 – volume: 49 start-page: 738 issue: 5 year: 2003 ident: 10.1016/j.ejor.2017.07.060_bib0005 article-title: A 2-opt tabu search procedure for the multiperiod forest harvesting problem with adjacency, greenup, old grwoth, and even flow constraints publication-title: Forest Science doi: 10.1093/forestscience/49.5.738 – ident: 10.1016/j.ejor.2017.07.060_bib0017 – volume: 20 start-page: 689 year: 2013 ident: 10.1016/j.ejor.2017.07.060_bib0030 article-title: A branch-and-bound procedure for forest harvest scheduling problems addressing aspects of habitat availability publication-title: International Transactions in Operational Research doi: 10.1111/itor.12003 – year: 1998 ident: 10.1016/j.ejor.2017.07.060_bib0046 – volume: 36 start-page: 561 year: 2002 ident: 10.1016/j.ejor.2017.07.060_bib0003 article-title: Eight heuristic planning techniques applied to three increasingly difficult wildlife planning problems publication-title: Silva Fennica doi: 10.14214/sf.545 – year: 1999 ident: 10.1016/j.ejor.2017.07.060_sbref0021 – volume: 212 start-page: 346 year: 2005 ident: 10.1016/j.ejor.2017.07.060_bib0033 article-title: Reducing forest fragmentation in long-term forest planning by using the shape index publication-title: Forest Ecology and Management doi: 10.1016/j.foreco.2005.03.059 – volume: 25 start-page: 1830 issue: 11 year: 1995 ident: 10.1016/j.ejor.2017.07.060_bib0002 article-title: Characterizing spatial structure of forest landscapes publication-title: Canadian Journal of Forest Research doi: 10.1139/x95-198 – volume: 166 start-page: 245 year: 2002 ident: 10.1016/j.ejor.2017.07.060_bib0019 article-title: The performance of alternative spatial objective types in forest planning calculations: A case for flying squirrel and moose publication-title: Forest Ecology and Management doi: 10.1016/S0378-1127(01)00664-8 – volume: 37 start-page: 1924 issue: 10 year: 2006 ident: 10.1016/j.ejor.2017.07.060_bib0043 article-title: Scheduling forest core area production using mixed integer programming publication-title: Canadian Journal of Forest Research doi: 10.1139/X07-033 |
| SSID | ssj0001515 |
| Score | 2.3138509 |
| Snippet | •A new model in integer programming for the forest harvest scheduling is proposed.•The model mitigates forest fragmentation caused by harvestings.•A... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 723 |
| SubjectTerms | Cutting plane Forest management Integer programming OR in natural resources |
| Title | Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints |
| URI | https://dx.doi.org/10.1016/j.ejor.2017.07.060 |
| Volume | 265 |
| WOSCitedRecordID | wos000416396200026&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/eLvHCXMwtV3da9swEBdZOkb3sI-sZd26oYe9BRXLX5Ifu9KxDlYG6yBPM5IsrwnFKYlT-gfsD9-dJTnpWso2GAQnKFGs-H65O53vfkfIu1pGwoBlZFmmI5bmJmVaasukrbmqpYYtmemaTYjTUzmZFF8Gg5-hFubqQjSNvL4uLv-rqGEMhI2ls38h7v5LYQBeg9DhCGKH4x8J_j22yjhnqqmYWbV9GiE8gwEYn6sFEmuMYVMLRqarRV-uNAZj0As12EQCZ7lqN7y3AE4lpqYvu14Sjvbpzki-92phYBHii55IqA84HzlftJ127b7Hn6c_VnadltjxGTidtVTav-HjEVyuE7JckOxWoYwrzhKCxbEr0zywTtdKEbNcunYCQRnHrnOER128oVqFq0v2Vlq4EOgtA-BiEbMDO5sj2ysXHTWrP8dNYu2vuChcExed4pMPyFYsskIOydbhyfHkU2_R0enr7kb5H-GLr1ye4O9nutvB2XBazp6RJ363QQ8dSp6TgW1G5FEodhiRp6GpB_U6fkQebzBUviDfb6KJAooooIk6NFGPJrpGE_Voou2cBjRRmE0RTRTRRDfQtEO-fTg-O_rIfEsOZpIkbllVc1uZolbgpiaVUkZUaZ5HJkFeuITzPDZSp9JoJTNZp0h9yWMlawO7EmFrm-ySYTNv7EtClS50Bc5igR0RrC200LwGh1anqS2ETvcID9exNJ6vHhd3UYbExFmJ177Ea19G8MijPTLu51w6tpZ7P50F8ZTe33R-ZAloumfeq3-c95psr_8w-2TYLlb2DXlortrpcvHWg-4XT0eoYQ |
| 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=Branch-and-cut+for+the+forest+harvest+scheduling+subject+to+clearcut+and+core+area+constraints&rft.jtitle=European+journal+of+operational+research&rft.au=Constantino%2C+Miguel&rft.au=Martins%2C+Isabel&rft.date=2018-03-01&rft.pub=Elsevier+B.V&rft.issn=0377-2217&rft.eissn=1872-6860&rft.volume=265&rft.issue=2&rft.spage=723&rft.epage=734&rft_id=info:doi/10.1016%2Fj.ejor.2017.07.060&rft.externalDocID=S0377221717307038 |
| 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 |