Harvest Scheduling Subject to Maximum Area Restrictions: Exploring Exact Approaches
We consider a spatial problem arising in forest harvesting. For regulatory reasons, blocks harvested should not exceed a certain total area, typically 49 hectares. Traditionally, this problem, called the adjacency problem, has been approached by forming a priori blocks from basic cells of 5 to 25 he...
Saved in:
| Published in | Operations research Vol. 53; no. 3; pp. 490 - 500 |
|---|---|
| Main Authors | , , , , |
| Format | Journal Article |
| Language | English |
| Published |
Linthicum, MD
INFORMS
01.05.2005
Institute for Operations Research and the Management Sciences |
| Subjects | |
| Online Access | Get full text |
Cover
Loading…
| Abstract | We consider a spatial problem arising in forest harvesting. For regulatory reasons, blocks harvested should not exceed a certain total area, typically 49 hectares. Traditionally, this problem, called the adjacency problem, has been approached by forming a priori blocks from basic cells of 5 to 25 hectares and solving the resulting mixed-integer program. Superior solutions can be obtained by including the construction of blocks in the decision process. The resulting problem is far more complex combinatorially. We present an exact algorithmic approach that has yielded good results in computational tests. This solution approach is based on determining a strong formulation of the linear programming problem through a clique representation of a projected problem. |
|---|---|
| AbstractList | We consider a spatial problem arising in forest harvesting. For regulatory reasons, blocks harvested should not exceed a certain total area, typically 49 hectares. Traditionally, this problem, called the adjacency problem, has been approached by forming a priori blocks from basic cells of 5 to 25 hectares and solving the resulting mixed-integer program. Superior solutions can be obtained by including the construction of blocks in the decision process. The resulting problem is far more complex combinatorially. We present an exact algorithmic approach that has yielded good results in computational tests. This solution approach is based on determining a strong formulation of the linear programming problem through a clique representation of a projected problem. We consider a spatial problem arising in forest harvesting. For regulatory reasons, blocks harvested should not exceed a certain total area, typically 49 hectares. Traditionally, this problem, called the adjacency problem, has been approached by forming a priori blocks from basic cells of 5 to 25 hectares and solving the resulting mixed-integer program. Superior solutions can be obtained by including the construction of blocks in the decision process. The resulting problem is far more complex combinatorially. We present an exact algorithmic approach that has yielded good results in computational tests. This solution approach is based on determining a strong formulation of the linear programming problem through a clique representation of a project problem. [PUBLICATION ABSTRACT] |
| Audience | Trade |
| Author | Weintraub, Andres Barahona, Francisco Epstein, Rafael Murray, Alan T Goycoolea, Marcos |
| Author_xml | – sequence: 1 fullname: Goycoolea, Marcos – sequence: 2 fullname: Murray, Alan T – sequence: 3 fullname: Barahona, Francisco – sequence: 4 fullname: Epstein, Rafael – sequence: 5 fullname: Weintraub, Andres |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=16924818$$DView record in Pascal Francis |
| BookMark | eNqFkc-L1DAcxYOs4Ozq1ZtQBL11_Kb5MY23YRldYUVwFLyFTJrMZGibmrQ6-99vQpfZy4rkEAif977fvHeJLnrfG4ReY1jiql598EMwSwwUloC5eIYWmFW8ZJSTC7QAIFASTn-9QJcxHgFAMM4WaHujwh8Tx2KrD6aZWtfvi-20Oxo9FqMvvqqT66auWAejiu-JC06PzvfxY7E5Da0Pmd-cVKLXwxC8Si7xJXpuVRvNq4f7Cv38tPlxfVPefvv85Xp9W2q2grE0zQoLQzmzO6ZsAwaYgJpYW0PF0j-4rqFR2Da6qivNNBWcCiA7smPENMDIFXo7-6bBv6e0nDz6KfRppKywwIKSlUhQOUN71RrpeuvHoPTe9CaoNgVoXXpeY0Kx4JjzxC-f4NNpTOf0k4J3D1uoqFVrg-q1i3IIrlPhTqYqKlrjOnF05nTwMQZjpXajymGmAa6VGGSuUeYaZa5R5hof9znLzs7_EryZBcc4-nCmU6SU1zV5DCT_LXTx_37vZ_7g9oe_LsyhZGEGo2REEpmLuQd0i8am |
| CODEN | OPREAI |
| CitedBy_id | crossref_primary_10_1111_itor_13183 crossref_primary_10_1007_s10479_014_1608_4 crossref_primary_10_1016_j_compag_2022_107354 crossref_primary_10_1007_s10342_010_0405_0 crossref_primary_10_1016_j_ejor_2009_06_027 crossref_primary_10_1007_s12076_008_0015_3 crossref_primary_10_1287_inte_1100_0537 crossref_primary_10_1007_s10589_010_9347_1 crossref_primary_10_1016_j_compenvurbsys_2022_101871 crossref_primary_10_1080_13658816_2011_633918 crossref_primary_10_1080_10549811_2013_804796 crossref_primary_10_1287_opre_2013_1183 crossref_primary_10_3389_ffgc_2023_1163105 crossref_primary_10_1093_forsci_fxy006 crossref_primary_10_1093_forsci_fxy044 crossref_primary_10_1007_s10109_019_00302_5 crossref_primary_10_1139_cjfr_2018_0053 crossref_primary_10_1016_j_ejor_2007_08_033 crossref_primary_10_1016_j_ejor_2013_01_020 crossref_primary_10_3390_f11020224 crossref_primary_10_1007_s12351_009_0075_1 crossref_primary_10_12737_17771 crossref_primary_10_1016_j_jenvman_2022_115060 crossref_primary_10_1111_j_1475_3995_2010_00800_x crossref_primary_10_1287_opre_1070_0472 crossref_primary_10_1007_s10479_012_1178_2 crossref_primary_10_1007_s10479_024_06304_x crossref_primary_10_1111_itor_12003 crossref_primary_10_1007_s10479_016_2313_2 crossref_primary_10_1016_j_foreco_2007_09_033 crossref_primary_10_3390_pr8040476 crossref_primary_10_1016_j_ejor_2017_07_060 crossref_primary_10_1016_j_ecolind_2021_107854 crossref_primary_10_3390_f14091717 crossref_primary_10_1590_S0103_20032010000200001 crossref_primary_10_1016_j_cor_2006_09_024 crossref_primary_10_1016_j_foreco_2021_119649 crossref_primary_10_1057_jors_2013_58 crossref_primary_10_1007_s10479_015_1907_4 crossref_primary_10_1016_j_jfe_2016_06_002 crossref_primary_10_1016_j_ecolmodel_2019_02_017 crossref_primary_10_1016_j_jfe_2014_06_002 crossref_primary_10_1017_S0021859609008570 crossref_primary_10_1287_inte_1060_0222 crossref_primary_10_15684_formath_19_005 crossref_primary_10_1016_j_ejor_2005_09_016 crossref_primary_10_1111_j_1475_3995_2009_00749_x crossref_primary_10_1287_opre_2018_1758 crossref_primary_10_1016_j_forpol_2013_06_011 crossref_primary_10_3390_f15122236 crossref_primary_10_1016_j_forpol_2018_03_006 crossref_primary_10_15684_formath_13_97 crossref_primary_10_1007_s10479_009_0525_4 crossref_primary_10_1080_03155986_2016_1197543 crossref_primary_10_3390_f13030471 crossref_primary_10_1080_02827581_2016_1195441 crossref_primary_10_1093_forsci_fxab025 crossref_primary_10_1080_02827581_2015_1089931 crossref_primary_10_1007_s43069_021_00069_w crossref_primary_10_1111_gean_12263 crossref_primary_10_1111_j_1475_3995_2011_00800_x crossref_primary_10_1139_cjfr_2019_0152 crossref_primary_10_1590_01047760201521042006 crossref_primary_10_1007_s10479_006_0105_9 crossref_primary_10_1007_s10479_012_1301_4 crossref_primary_10_1002_ldr_3425 crossref_primary_10_1016_j_dam_2005_05_025 crossref_primary_10_1007_s11750_012_0260_x crossref_primary_10_1016_j_biombioe_2011_06_021 crossref_primary_10_1139_cjfr_2012_0265 crossref_primary_10_1111_itor_13316 crossref_primary_10_1007_s40725_017_0068_x crossref_primary_10_15684_formath_24_002 crossref_primary_10_1007_s10310_015_0507_0 crossref_primary_10_1016_j_ejor_2019_09_034 crossref_primary_10_1016_j_enpol_2013_11_071 crossref_primary_10_1155_2009_527392 crossref_primary_10_3390_f14040788 crossref_primary_10_3138_infor_46_4_265 crossref_primary_10_1016_j_ejor_2016_06_071 crossref_primary_10_1007_s40725_024_00222_8 crossref_primary_10_1016_j_cor_2023_106182 crossref_primary_10_1016_j_ejor_2013_03_025 |
| Cites_doi | 10.1002/9781118627372 10.1093/forestscience/37.5.1283 10.1016/S0377-2217(96)00175-0 10.1007/BF01719265 10.5558/tfc49247-6 10.1057/jors.1992.71 10.1139/x90-126 10.1139/x96-214 10.1016/S0378-1127(00)00417-5 10.1139/x93-065 10.1093/forestscience/46.2.204 10.1007/BF01584085 10.1007/BF01580121 10.1093/forestscience/45.1.45 10.1139/x03-101 10.1137/S0895480190182678 10.1093/forestscience/48.1.35 10.1093/forestscience/44.4.569 10.1016/0095-8956(81)90033-2 10.1093/forestscience/48.4.631 10.1093/forestscience/46.2.188 10.1093/forestscience/42.2.166 10.1139/x89-111 10.1023/A:1018993822494 10.1287/opre.40.1.S14 10.1093/forestscience/39.1.152 10.1093/forestscience/44.4.526 10.1093/jof/81.9.601 |
| ContentType | Journal Article |
| Copyright | Copyright 2005 INFORMS 2005 INIST-CNRS COPYRIGHT 2005 Institute for Operations Research and the Management Sciences Copyright Institute for Operations Research and the Management Sciences May/Jun 2005 |
| Copyright_xml | – notice: Copyright 2005 INFORMS – notice: 2005 INIST-CNRS – notice: COPYRIGHT 2005 Institute for Operations Research and the Management Sciences – notice: Copyright Institute for Operations Research and the Management Sciences May/Jun 2005 |
| DBID | AAYXX CITATION IQODW 3V. 7WY 7WZ 7X7 7XB 87Z 88E 88F 8AL 8AO 8FE 8FG 8FI 8FJ 8FK 8FL 8G5 ABJCF ABUWG AFKRA ARAPS AZQEC BENPR BEZIV BGLVJ CCPQU DWQXO FRNLG FYUFA F~G GHDGH GNUQQ GUQSH HCIFZ JQ2 K60 K6~ K7- K9. L.- L6V M0C M0N M0S M1P M1Q M2O M7S MBDVC P5Z P62 PHGZM PHGZT PJZUB PKEHL PPXIY PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI PRINS PTHSS Q9U |
| DOI | 10.1287/opre.1040.0169 |
| DatabaseName | CrossRef Pascal-Francis ProQuest Central (Corporate) ABI/INFORM Collection ABI/INFORM Global (PDF only) Health & Medical Collection ProQuest Central (purchase pre-March 2016) ABI/INFORM Global (Alumni Edition) Medical Database (Alumni Edition) Military Database (Alumni Edition) Computing Database (Alumni Edition) ProQuest Pharma Collection ProQuest SciTech Collection ProQuest Technology Collection Hospital Premium Collection Hospital Premium Collection (Alumni Edition) ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni) ProQuest Research Library Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Central Business Premium Collection Technology Collection ProQuest One Community College ProQuest Central Korea Business Premium Collection (Alumni) Health Research Premium Collection ABI/INFORM Global (Corporate) Health Research Premium Collection (Alumni) ProQuest Central Student ProQuest Research Library SciTech Premium Collection ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database ProQuest Health & Medical Complete (Alumni) ABI/INFORM Professional Advanced ProQuest Engineering Collection ABI/INFORM Global Computing Database Health & Medical Collection (Alumni) Medical Database Military Database (ProQuest) ProQuest Research Library Engineering Database Research Library (Corporate) Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic (New) ProQuest Health & Medical Research Collection ProQuest One Academic Middle East (New) ProQuest One Health & Nursing ProQuest One Business ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection ProQuest Central Basic |
| DatabaseTitle | CrossRef ProQuest Business Collection (Alumni Edition) Research Library Prep Computer Science Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection SciTech Premium Collection ProQuest Military Collection ProQuest Central China ABI/INFORM Complete ProQuest One Applied & Life Sciences Health Research Premium Collection Health & Medical Research Collection ProQuest Central (New) ProQuest Medical Library (Alumni) Engineering Collection Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global Engineering Database ProQuest One Academic Eastern Edition ProQuest Hospital Collection ProQuest Technology Collection Health Research Premium Collection (Alumni) ProQuest Business Collection ProQuest Hospital Collection (Alumni) ProQuest Health & Medical Complete ProQuest One Academic UKI Edition ProQuest One Academic ProQuest One Academic (New) ABI/INFORM Global (Corporate) ProQuest One Business Technology Collection ProQuest One Academic Middle East (New) ProQuest Health & Medical Complete (Alumni) ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest One Health & Nursing Research Library (Alumni Edition) ProQuest Pharma Collection ProQuest Central ABI/INFORM Professional Advanced ProQuest Health & Medical Research Collection ProQuest Engineering Collection Health and Medicine Complete (Alumni Edition) ProQuest Central Korea ProQuest Research Library ABI/INFORM Complete (Alumni Edition) ProQuest Computing ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest Military Collection (Alumni Edition) ProQuest SciTech Collection Advanced Technologies & Aerospace Database ProQuest Medical Library Materials Science & Engineering Collection ProQuest One Business (Alumni) ProQuest Central (Alumni) Business Premium Collection (Alumni) |
| DatabaseTitleList | CrossRef ProQuest Business Collection (Alumni Edition) |
| Database_xml | – sequence: 1 dbid: 8FG name: ProQuest Technology Collection url: https://search.proquest.com/technologycollection1 sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Sciences (General) Computer Science Business Applied Sciences |
| EISSN | 1526-5463 |
| EndPage | 500 |
| ExternalDocumentID | 866369991 A134196166 16924818 10_1287_opre_1040_0169 25146883 opre.1040.0169 opres_53_3_490 |
| Genre | Research Article Feature |
| GeographicLocations | United States |
| GeographicLocations_xml | – name: United States |
| GroupedDBID | 02 08R 123 1AW 1OL 29N 2AX 3V. 4.4 7WY 7X7 85S 88E 8AL 8AO 8FE 8FG 8FI 8FJ 8FL 8G5 8V8 92 AABCJ ABBHK ABDEX ABEFU ABJCF ABPPZ ABSIS ABUWG ABWPA ACDCL ACHQT ACIWK ACNCT ACUWV ACVYA ADBBV ADGDI ADNFJ AENEX AEUPB AFFNX AFKRA AJPNJ AKVCP ALMA_UNASSIGNED_HOLDINGS AQNXB AQSKT ARAPS AZQEC B-7 BBAFP BENPR BEZIV BGLVJ BPHCQ BVXVI CBXGM CCKSF CS3 CWXUR CYVLN DWQXO DZ EBA EBE EBO EBR EBS EBU ECR EHE EJD EMI EMK EPL F20 F5P FH7 FRNLG FYUFA G8K GENNL GNUQQ GROUPED_ABI_INFORM_COMPLETE GROUPED_ABI_INFORM_RESEARCH GUPYA GUQSH HCIFZ HVGLF H~9 IAO ICJ IEA IGG IOF ITC JAV JBC JPL JSODD JST K6 K60 K6V K7- L6V LI M0C M0N M1P M1Q M2O M7S MBDVC MV1 N95 NIEAY P2P P62 PQEST PQQKQ PQUKI PRG PROAC PSQYO PTHSS QVA RNS RPU SA0 TAE TH9 TN5 U5U VQA WH7 X XFK XHC XI7 XJT XXP YHZ YNT YZZ ZCG AETEA HGD Y99 ZY4 -DZ -~X 18M AAAZS AAWTO AAXLS AAYOK ABAWQ ABDPE ABKVW ABLWH ABXSQ ABYYQ ACGFO ACHJO ACSVP ACXJH ADEPB ADMHG ADNWM ADULT AEGXH AEMOZ AFAIT AFTQD AGKTX AHAJD AHQJS AIAGR ALIPV APTMU ASMEE BAAKF CCPQU HF~ HMCUK IPSME JAAYA JBMMH JBZCM JENOY JHFFW JKQEH JLEZI JLXEF JPPEU K1G K6~ PHGZM PHGZT PQBIZ PQBZA UKHRP XOL XSW ~02 ~92 AAYXX ADMHC CITATION YYP IQODW PJZUB PPXIY PQGLB PMFND 7XB 8FK JQ2 K9. L.- PKEHL PRINS Q9U |
| ID | FETCH-LOGICAL-c570t-ed719e465fb5afd0e059083ff80251046c80da1fdc282c5c4964903b3b53ed053 |
| IEDL.DBID | 7X7 |
| ISSN | 0030-364X |
| IngestDate | Fri Jul 25 10:50:43 EDT 2025 Fri Jun 13 00:45:12 EDT 2025 Tue Jun 10 21:29:56 EDT 2025 Mon Jul 21 09:15:30 EDT 2025 Tue Jul 01 04:26:23 EDT 2025 Thu Apr 24 22:55:24 EDT 2025 Thu Jun 19 16:02:47 EDT 2025 Tue Jan 05 23:29:21 EST 2021 Fri Jan 15 03:35:26 EST 2021 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Keywords | Integer programming Natural resources Energy Environment Forest management Linear programming Mixed integer programming Scheduling cutting planes Cutting plane method |
| Language | English |
| License | CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c570t-ed719e465fb5afd0e059083ff80251046c80da1fdc282c5c4964903b3b53ed053 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 |
| OpenAccessLink | http://americanae.aecid.es/americanae/es/registros/registro.do?tipoRegistro=MTD&idBib=3230061 |
| PQID | 219194379 |
| PQPubID | 37962 |
| PageCount | 11 |
| ParticipantIDs | pascalfrancis_primary_16924818 informs_primary_10_1287_opre_1040_0169 highwire_informs_opres_53_3_490 gale_infotracacademiconefile_A134196166 crossref_citationtrail_10_1287_opre_1040_0169 crossref_primary_10_1287_opre_1040_0169 proquest_journals_219194379 gale_infotracgeneralonefile_A134196166 jstor_primary_25146883 |
| ProviderPackageCode | Y99 RPU NIEAY CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2005-05-01 |
| PublicationDateYYYYMMDD | 2005-05-01 |
| PublicationDate_xml | – month: 05 year: 2005 text: 2005-05-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationPlace | Linthicum, MD |
| PublicationPlace_xml | – name: Linthicum, MD – name: Linthicum |
| PublicationTitle | Operations research |
| PublicationYear | 2005 |
| Publisher | INFORMS Institute for Operations Research and the Management Sciences |
| Publisher_xml | – name: INFORMS – name: Institute for Operations Research and the Management Sciences |
| References | B20 B21 B22 B23 B24 B25 B26 B27 B28 B29 B30 B31 B10 B32 B11 B33 B12 B13 B14 B15 B16 B17 B18 B19 B1 B2 B3 B4 B5 B6 B7 B8 B9 Jones J. G. (B17) 1991; 37 Murray A. T. (B22) 1999; 45 McDill M. E. (B21) 2002; 48 Daust D. K. (B12) 1993; 39 Boston K. (B9) 2002; 48 Hoganson H. M. (B15) 1998; 44 Clark M. M. (B10) 2000; 46 Sessions J. (B32) 1991 Hokans R. H. (B16) 1983; 81 Murray A. T. (B24) 1996; 42 Barrett T. M. (B7) 1998; 44 Richards E. W. (B31) 2000; 46 |
| References_xml | – ident: B12 – ident: B9 – ident: B14 – ident: B10 – ident: B3 – ident: B20 – ident: B1 – ident: B27 – ident: B7 – ident: B5 – ident: B29 – ident: B25 – ident: B23 – ident: B21 – ident: B18 – ident: B16 – ident: B31 – ident: B33 – ident: B8 – ident: B11 – ident: B13 – ident: B2 – ident: B26 – ident: B4 – ident: B28 – ident: B6 – ident: B24 – ident: B22 – ident: B17 – ident: B32 – ident: B15 – ident: B30 – ident: B19 – ident: B28 doi: 10.1002/9781118627372 – volume: 37 start-page: 1283 year: 1991 ident: B17 publication-title: Forest Sci. doi: 10.1093/forestscience/37.5.1283 – ident: B25 doi: 10.1016/S0377-2217(96)00175-0 – ident: B23 doi: 10.1007/BF01719265 – ident: B33 doi: 10.5558/tfc49247-6 – ident: B27 doi: 10.1057/jors.1992.71 – ident: B26 doi: 10.1139/x90-126 – start-page: 362 issue: 4 volume-title: Proc. 1991 Soc. American Foresters National Conventions year: 1991 ident: B32 – ident: B5 doi: 10.1139/x96-214 – ident: B8 doi: 10.1016/S0378-1127(00)00417-5 – ident: B18 doi: 10.1139/x93-065 – volume: 46 start-page: 204 year: 2000 ident: B10 publication-title: Forest Sci. doi: 10.1093/forestscience/46.2.204 – ident: B13 doi: 10.1007/BF01584085 – ident: B30 doi: 10.1007/BF01580121 – volume: 45 start-page: 1 year: 1999 ident: B22 publication-title: Forest Sci. doi: 10.1093/forestscience/45.1.45 – ident: B11 doi: 10.1139/x03-101 – ident: B3 doi: 10.1137/S0895480190182678 – volume: 48 start-page: 35 year: 2002 ident: B9 publication-title: Forest Sci. doi: 10.1093/forestscience/48.1.35 – volume: 44 start-page: 569 year: 1998 ident: B7 publication-title: Forest Sci. doi: 10.1093/forestscience/44.4.569 – ident: B14 doi: 10.1016/0095-8956(81)90033-2 – volume: 48 start-page: 631 year: 2002 ident: B21 publication-title: Forest Sci. doi: 10.1093/forestscience/48.4.631 – volume: 46 start-page: 188 year: 2000 ident: B31 publication-title: Forest Sci. doi: 10.1093/forestscience/46.2.188 – volume: 42 start-page: 166 year: 1996 ident: B24 publication-title: Forest Sci. doi: 10.1093/forestscience/42.2.166 – ident: B29 doi: 10.1139/x89-111 – ident: B6 doi: 10.1023/A:1018993822494 – ident: B4 doi: 10.1287/opre.40.1.S14 – volume: 39 start-page: 152 year: 1993 ident: B12 publication-title: Forest Sci. doi: 10.1093/forestscience/39.1.152 – volume: 44 start-page: 526 year: 1998 ident: B15 publication-title: Forest Sci. doi: 10.1093/forestscience/44.4.526 – volume: 81 start-page: 601 year: 1983 ident: B16 publication-title: J. Forestry doi: 10.1093/jof/81.9.601 |
| SSID | ssj0009565 |
| Score | 2.1320333 |
| SecondaryResourceType | review_article |
| Snippet | We consider a spatial problem arising in forest harvesting. For regulatory reasons, blocks harvested should not exceed a certain total area, typically 49... |
| SourceID | proquest gale pascalfrancis crossref jstor informs highwire |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 490 |
| SubjectTerms | Algorithms Analysis Applied sciences cutting planes environment Exact sciences and technology Forest habitats Forest management Forestry research Harvesting Heuristics Integer programming Integers Linear programming Mathematical programming Operational research and scientific management Operational research. Management science Polyhedrons Regulation Scheduling Studies Sustainable forest management Timber Timber industry |
| Title | Harvest Scheduling Subject to Maximum Area Restrictions: Exploring Exact Approaches |
| URI | http://or.journal.informs.org/cgi/content/abstract/53/3/490 https://www.jstor.org/stable/25146883 https://www.proquest.com/docview/219194379 |
| Volume | 53 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwhV3db9MwED_BJiH2AKwwLRuUPCA-HsLc-SvhBRW0MiFtQoNJfbPi2AGkrd2WTuLP586xyyq-XqqoudiR73z2xXe_H8Azx5nznNnC1qOqEK2URSUEL5j2GG446SSjAuejY3V4Kj5O5TTm5nQxrTL5xOCo3byhb-R7OLMw3ua6entxWRBpFB2uRgaN27BOyGWU0aWn-gbmruoJDDi6GiWmEbMRY4Q9Yhih4032mtBIVtak5JkTXHAoc6INZJdSFil_su5wCNue--I3Nx7WpskDuBc3lfm4t4JNuOVnA7iTctoHcD9xN-RxKg9g4wYQ4QA24_9d_jLiUL96CJ-JNwh7w4e-4YJEdes5-hn6cJMv5vlR_eP7-fU59urr_MQT_0eokeje5MvEPryqUXocgct99whOJwdf3h8WkYOhaKRmi8I7Paq8ULK1sm4d84EknbdtScEJBtdNyVw9al2DsVsjG1EpUTFuuZXcO5zhW7A2m8_8NuQSFz69r7xiVotm31pNZ3SEAKeU5IxlUCQtmCYClBNPxpmhQAW1ZkhrhrRmSGsZvFjKX_TQHH-XJKUa0iO22NSx9ADfi9CvzDig2qmRUhk8X5H82o_5nwSfJgMx0TxCp52R3HCDY4BNpRv_e7utYFZLMRxYocqSZzBcsbNf7SiMmnGnlcFuMjwTXU9nlhNl5593d-FuQKENuZuPYW1xde2f4P5qYYdhFuFvOfkwhPV3B8efTn4CZs8iuQ |
| linkProvider | ProQuest |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9NAEB5VReJxABqoCIV2DzwPppvswzYSQhEQUtr0AK2U29b2rgGJJgWnAn4U_5GZ9W5oxOvUWxSP19bO7MyOd-b7AO5Zwa0TvEzKopcnslYqyaUUCU8dphtWWcWpwXm8r0eH8s1ETVbgR-yFobLK6BO9o7azir6Rb-PKwnxbpPnzk88JkUbR4Wpk0GitYtd9_4oZW_Ns5yWq936_P3x18GKUBFKBpFIpnyfOpr3cSa3qUhW15c6zfou6zmi3jdlilXFb9GpbYTJSqUrmWuZclKJUwllOJBHo8S9IIXJaUNnw9RmMX90SJgh0bVpOAkYk5iTbxGhCx6n8CaGfLMXAGAkiPLFvq6INaxNLJKles2hQZXXLtfFb2PCxcHgdroZNLBu0VrcGK27agYuxhr4D1yJXBAuuowNXzgAfdmAt_N-wRwH3-vENeEc8Rfg0vOkDBkDqk2fo1-hDEZvP2Lj49vH49Bif6gr21hHfiO_JaJ6yRSEh_ipQehCA0l1zEw7PRT3rsDqdTd0tYAoDbdrXTvMylVW_LFM6EyTEOa2V4LwLSdSCqQIgOvFyfDKUGKHWDGnNkNYMaa0LDxfyJy0UyN8lSamG9IgjVkVodcD3IrQtM_AoerqndRceLEm-b-f8T4Jb0UBMMA__0MYoYYTBOcCh4oX_vd26N6uFGE6s1FkmurC5ZGe_xtGYpePOrgsb0fBMcHWNWSzM2_-8ugWXRgfjPbO3s7-7AZc9Aq6vG70Dq_Mvp-4u7u3m5aZfUQyOznsJ_wTYaFx1 |
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9NAEB5VRargADRQYQrtHngeTNbZV4yEUESJWkorBFTKbfFjDUg0KTgV8NP4d8ysd0MjXqfeoni8tnYeu-Od-T6AO7XgtRO8TMsiy1PZKJXmUoqUG4fpRq1qxanB-eBQ7x7JFxM1WYEfsReGyipjTPSBup5V9I28j56F-bYweb8JVRGvdsZPTz6nRCBFB62RTaOzkH33_Stmb-2TvR1U9d3BYPz87bPdNBAMpJUyfJ662mS5k1o1pSqamjvPAC6aZkg7b8wcqyGvi6ypK0xMKlXJXMuci1KUSriaE2EERv8LRqiMXMxMzBm8X92RJwgMc1pOAl4k5id9Yjeho1X-iJBQltbDuCpEqGLfYkWb1zaWS1LtZtGi-pqOd-O3JcSvi-OrcDlsaNmos8B1WHHTHqzFevoeXIm8ESyEkR5cOgOC2IP18H_LHgQM7IfX4A1xFuHT8KYPuBhSzzzDGEcfjdh8xg6Kbx-PT4_xqa5grx1xj_j-jPYxWxQV4q8CpUcBNN211-HoXNSzAavT2dTdAKZw0TUD7TQvjawGZWnofJDQ57RWgvME0qgFWwVwdOLo-GQpSUKtWdKaJa1Z0loC9xfyJx0syN8lSamW9IgjVkVoe8D3IuQtO_KIejrTOoF7S5Lvuzn_k-B2NBAbzMM_tLVKWGFxDnCoeOF_b7fhzWohhhMr9XAoEthasrNf42jM2HGXl8BmNDwbwl5rF056859Xt2ENnde-3Dvc34SLHgzXl5DegtX5l1N3G7d583LLOxSDd-ftwT8BMlZgog |
| 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=Harvest+Scheduling+Subject+to+Maximum+Area+Restrictions%3A+Exploring+Exact+Approaches&rft.jtitle=Operations+research&rft.au=Goycoolea%2C+Marcos&rft.au=Murray%2C+Alan+T.&rft.au=Barahona%2C+Francisco&rft.au=Epstein%2C+Rafael&rft.date=2005-05-01&rft.issn=0030-364X&rft.eissn=1526-5463&rft.volume=53&rft.issue=3&rft.spage=490&rft.epage=500&rft_id=info:doi/10.1287%2Fopre.1040.0169&rft.externalDBID=n%2Fa&rft.externalDocID=10_1287_opre_1040_0169 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0030-364X&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0030-364X&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0030-364X&client=summon |