Solving a harvest scheduling optimization problem with constraints on clearcut area and clearcut proximity
This study aims at solving a harvesting scheduling optimization problem with constraints on the clearcut area with additional constraints on clearcut proximity. The objective function is defined as the net present value generated by harvesting discounted by a penalty for each clearcut. This problem...
Gespeichert in:
| Veröffentlicht in: | International transactions in operational research Jg. 30; H. 6; S. 3930 - 3948 |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Oxford
Blackwell Publishing Ltd
01.11.2023
|
| Schlagworte: | |
| ISSN: | 0969-6016, 1475-3995 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | This study aims at solving a harvesting scheduling optimization problem with constraints on the clearcut area with additional constraints on clearcut proximity. The objective function is defined as the net present value generated by harvesting discounted by a penalty for each clearcut. This problem arises to reduce the negative environmental impact of excessive harvesting. We propose the connected‐bucket model, the so‐called bucket model with additional constraints on bucket connectivity and two definitions of stand adjacency, and a Dantzig–Wolfe decomposition. The decomposed model is solved by branch‐and‐price and the connected‐bucket model by a general‐purpose mixed integer programming solver (CPLEX). We compare the quality of the solutions obtained with both approaches for real instances. The branch‐and‐price approach found better solutions for the majority of the instances. |
|---|---|
| AbstractList | This study aims at solving a harvesting scheduling optimization problem with constraints on the clearcut area with additional constraints on clearcut proximity. The objective function is defined as the net present value generated by harvesting discounted by a penalty for each clearcut. This problem arises to reduce the negative environmental impact of excessive harvesting. We propose the connected‐bucket model, the so‐called bucket model with additional constraints on bucket connectivity and two definitions of stand adjacency, and a Dantzig–Wolfe decomposition. The decomposed model is solved by branch‐and‐price and the connected‐bucket model by a general‐purpose mixed integer programming solver (CPLEX). We compare the quality of the solutions obtained with both approaches for real instances. The branch‐and‐price approach found better solutions for the majority of the instances. This study aims at solving a harvesting scheduling optimization problem with constraints on the clearcut area with additional constraints on clearcut proximity. The objective function is defined as the net present value generated by harvesting discounted by a penalty for each clearcut. This problem arises to reduce the negative environmental impact of excessive harvesting. We propose the connected‐bucket model, the so‐called bucket model with additional constraints on bucket connectivity and two definitions of stand adjacency, and a Dantzig–Wolfe decomposition. The decomposed model is solved by branch‐and‐price and the connected‐bucket model by a general‐purpose mixed integer programming solver (CPLEX). We compare the quality of the solutions obtained with both approaches for real instances. The branch‐and‐price approach found better solutions for the majority of the instances. |
| Author | Kašpar, Jan Alvelos, Filipe Cerveira, Adelaide Martins, Isabel Marušák, Robert |
| Author_xml | – sequence: 1 givenname: Isabel orcidid: 0000-0003-0205-0645 surname: Martins fullname: Martins, Isabel email: isabelinha@isa.ulisboa.pt organization: Center of Mathematics, Fundamental Applications and Operations Research ‐ University of Lisbon – sequence: 2 givenname: Filipe orcidid: 0000-0002-1851-4339 surname: Alvelos fullname: Alvelos, Filipe email: falvelos@dps.uminho.pt organization: ALGORITMI Research Centre ‐ University of Minho – sequence: 3 givenname: Adelaide orcidid: 0000-0002-7494-6566 surname: Cerveira fullname: Cerveira, Adelaide email: cerveira@utad.pt organization: INESCTEC – sequence: 4 givenname: Jan orcidid: 0000-0001-8500-9896 surname: Kašpar fullname: Kašpar, Jan email: kasparj@fld.czu.cz organization: Czech University of Life Sciences Prague – sequence: 5 givenname: Robert orcidid: 0000-0003-4745-5603 surname: Marušák fullname: Marušák, Robert email: marusak@fld.czu.cz organization: Czech University of Life Sciences Prague |
| BookMark | eNp9kF1LwzAUhoNMcJve-AsC3gmd-WiT9lKGH4PBQOd1iGnqMrpmJunm_PWmqyCImJvAOe_7nnOeERg0ttEAXGI0wfHdmGDdBFOc0xMwxCnPEloU2QAMUcGKhCHMzsDI-zVCCGeYD8H62dY707xBCVfS7bQP0KuVLtu6K9ptMBvzKYOxDdw6-1rrDdybsILKNj44aZrgYeypWkun2gCl0xLKpvypRNtHDAmHc3Baydrri-9_DF7u75bTx2S-eJhNb-eJojmlcWHFJK8Y5wRVFclTwkpNUlkUEhVlRUqmEUMq05pQTkuqKM94xlJNtMpwVtAxuOpz4-T3Nl4k1rZ1TRwpSE4xQ4QjFFXXvUo5673Tldg6s5HuIDASHUvRsRRHllGMfomVCUcqHYP6bwvuLXtT68M_4WK2XDz1ni9oq4r9 |
| CitedBy_id | crossref_primary_10_3390_f14091717 crossref_primary_10_1016_j_forpol_2025_103575 crossref_primary_10_1007_s12597_025_00949_3 crossref_primary_10_1007_s40725_024_00222_8 |
| Cites_doi | 10.1093/forestscience/48.4.779 10.1287/opre.1070.0472 10.1093/forsci/fxab025 10.1016/j.ejor.2017.07.060 10.1093/forestscience/45.1.45 10.1016/j.ejor.2003.07.021 10.4324/9781849774925 10.1287/opre.1040.0169 10.1007/978-3-642-30671-6_11 10.1093/forestscience/48.4.631 10.1139/cjfr-2019-0152 10.1139/x03-101 10.1007/s10310-015-0507-0 10.1007/978-94-017-0307-9_27 10.1007/978-3-319-20328-7_14 10.5849/forsci.11-040 10.5849/forsci.14-179 10.1093/forsci/fxy006 10.1007/s10589-010-9347-1 10.1007/s40725-016-0027-y 10.1016/j.ejor.2005.09.016 |
| ContentType | Journal Article |
| Copyright | 2022 The Authors. International Transactions in Operational Research © 2022 International Federation of Operational Research Societies. 2023 The Authors. |
| Copyright_xml | – notice: 2022 The Authors. International Transactions in Operational Research © 2022 International Federation of Operational Research Societies. – notice: 2023 The Authors. |
| DBID | AAYXX CITATION 7SC 7TB 8FD FR3 JQ2 L7M L~C L~D |
| DOI | 10.1111/itor.13183 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Mechanical & Transportation Engineering Abstracts Technology Research Database Engineering Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Mechanical & Transportation Engineering Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | CrossRef Technology Research Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1475-3995 |
| EndPage | 3948 |
| ExternalDocumentID | 10_1111_itor_13183 ITOR13183 |
| Genre | article |
| GroupedDBID | --K .3N .GA .Y3 05W 0R~ 10A 1B1 1OC 1XV 29J 31~ 33P 4.4 50Y 50Z 51W 51Y 52M 52O 52Q 52S 52T 52U 52W 5GY 5HH 5LA 5VS 66C 702 7PT 8-0 8-1 8-3 8-4 8-5 8UM 8VB 930 A04 AABNI AAEDT AAESR AAHHS AAHQN AALRI AAMNL AANHP AAONW AAOUF AAQFI AAQXK AASGY AAXRX AAXUO AAYCA AAZKR ABCQN ABCUV ABEML ABJNI ABPVW ABSOO ABWVN ACAHQ ACBKW ACBWZ ACCFJ ACCZN ACGFS ACHQT ACIWK ACPOU ACRPL ACSCC ACXQS ACYXJ ADBBV ADEMA ADEOM ADIZJ ADKYN ADMGS ADMUD ADNMO ADXAS ADZMN ADZOD AEEZP AEIGN AEIMD AEMOZ AENEX AEQDE AEUQT AEUYR AFBPY AFEBI AFFPM AFGKR AFKFF AFPWT AFWVQ AFYRF AFZJQ AHBTC AHQJS AIFKG AIURR AIWBW AJBDE AKVCP ALAGY ALMA_UNASSIGNED_HOLDINGS ALUQN ALVPJ AMBMR AMYDB ASPBG ASTYK AVWKF AZBYB AZFZN AZVAB BAFTC BDRZF BFHJK BMXJE BNVMJ BQESF BROTX BRXPI BY8 CAG COF CS3 D-C D-D DCZOG DPXWK DR2 DRFUL DRSSH DU5 EBA EBO EBR EBS EBU EJD EMK F00 F01 F5P FDB FEDTE FGOYB FIRID G-S G.N G50 GODZA HGLYW HVGLF HZI HZ~ I-F IHE IX1 J0M K1G K48 LATKE LC2 LC4 LEEKS LG8 LH4 LITHE LOXES LP6 LP7 LUTES LW6 LYRES M41 MEWTI MK4 MRFUL MRSSH MSFUL MSSSH MXFUL MXSSH N04 N06 N9A NF~ NQ- O66 O9- OIG P2P P2W P2Y P4C PQQKQ Q.N Q11 QB0 QWB R.K R2- RIG ROL RPZ RX1 SEW SUPJJ TH9 UB1 UHS W8V W99 WBKPD WEBCB WIH WII WOHZO WQZ WRC WSUWO WXSBR XG1 ZL0 ZZTAW ~IA ~WP 9DU AAMMB AAYXX ACVFH ADCNI AEFGJ AEUPX AEYWJ AFPUW AGHNM AGQPQ AGXDD AIDQK AIDYY AMVHM CITATION O8X 7SC 7TB 8FD FR3 JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c3833-39c6a7f67720ff28426de24a99a09df2d6e060c5ee2373d3c3757564e2ec51593 |
| IEDL.DBID | DRFUL |
| ISICitedReferencesCount | 6 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000834265600001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0969-6016 |
| IngestDate | Sat Sep 06 11:31:53 EDT 2025 Sat Nov 29 06:31:38 EST 2025 Tue Nov 18 22:12:52 EST 2025 Wed Jan 22 16:21:54 EST 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 6 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c3833-39c6a7f67720ff28426de24a99a09df2d6e060c5ee2373d3c3757564e2ec51593 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0002-1851-4339 0000-0003-0205-0645 0000-0001-8500-9896 0000-0002-7494-6566 0000-0003-4745-5603 |
| OpenAccessLink | http://hdl.handle.net/1822/89805 |
| PQID | 2831602700 |
| PQPubID | 45259 |
| PageCount | 19 |
| ParticipantIDs | proquest_journals_2831602700 crossref_primary_10_1111_itor_13183 crossref_citationtrail_10_1111_itor_13183 wiley_primary_10_1111_itor_13183_ITOR13183 |
| PublicationCentury | 2000 |
| PublicationDate | November 2023 |
| PublicationDateYYYYMMDD | 2023-11-01 |
| PublicationDate_xml | – month: 11 year: 2023 text: November 2023 |
| PublicationDecade | 2020 |
| PublicationPlace | Oxford |
| PublicationPlace_xml | – name: Oxford |
| PublicationTitle | International transactions in operational research |
| PublicationYear | 2023 |
| Publisher | Blackwell Publishing Ltd |
| Publisher_xml | – name: Blackwell Publishing Ltd |
| References | 2018; 265 2021; 67 2010 2015; 31 2008 1999; 45 2008; 56 1996 2003 2018; 64 2003; 33 2012; 51 1999 2002; 48 2005; 161 2013; 59 2016; 2 2007; 176 2015; 232 2016; 21 2019; 49 2005; 53 2016; 62 2015 2013 e_1_2_8_24_1 e_1_2_8_25_1 e_1_2_8_26_1 e_1_2_8_27_1 McDill M.E. (e_1_2_8_18_1) 2002; 48 e_1_2_8_2_1 e_1_2_8_5_1 e_1_2_8_4_1 e_1_2_8_7_1 e_1_2_8_6_1 e_1_2_8_9_1 e_1_2_8_8_1 Borges P. (e_1_2_8_3_1) 2015; 31 Murray A. (e_1_2_8_20_1) 1999; 45 e_1_2_8_22_1 e_1_2_8_23_1 e_1_2_8_17_1 e_1_2_8_19_1 e_1_2_8_13_1 e_1_2_8_14_1 e_1_2_8_15_1 John R.S. (e_1_2_8_11_1) 2015; 232 e_1_2_8_16_1 Murray A. (e_1_2_8_21_1) 2002; 48 e_1_2_8_10_1 e_1_2_8_12_1 |
| References_xml | – volume: 265 start-page: 723 issue: 2 year: 2018 end-page: 734 article-title: Branch‐and‐cut for the forest harvest scheduling subject to clearcut and core area constraints publication-title: European Journal of Operational Research – volume: 45 start-page: 45 issue: 1 year: 1999 end-page: 52 article-title: Spatial restrictions in harvest scheduling publication-title: Forest Science – volume: 56 start-page: 542 issue: 3 year: 2008 end-page: 551 article-title: A new mixed integer programming model for harvest scheduling subject to maximum area restrictions publication-title: Operations Research – volume: 53 start-page: 490 issue: 3 year: 2005 end-page: 500 article-title: Harvest scheduling subject to maximum area restrictions: exploring exact approaches publication-title: Operations Research – volume: 232 start-page: 235 issue: 1 year: 2015 end-page: 257 article-title: Spatially explicit forest harvest scheduling with difference equations publication-title: Annals of Operations Research – start-page: 237 year: 2015 end-page: 260 – volume: 59 start-page: 157 issue: 2 year: 2013 end-page: 176 article-title: Testing the use of lazy constraints in solving area‐based adjacency formulations of harvest scheduling models publication-title: Forest Science – volume: 64 start-page: 392 issue: 4 year: 2018 end-page: 406 article-title: A new optimization model for spatially constrained harvest scheduling under area restrictions through maximum ow problem publication-title: Forest Science – volume: 2 start-page: 1 year: 2016 end-page: 17 article-title: Optimisation in forest management publication-title: Current Forestry Reports – volume: 62 start-page: 28 issue: 1 year: 2016 end-page: 37 article-title: Comparing model I and model II formulations of spatially explicit harvest scheduling models with maximum area restrictions publication-title: Forest Science – year: 1996 article-title: Defining adjacency and proximity of forest stands for harvest blocking – volume: 51 start-page: 363 issue: 1 year: 2012 end-page: 385 article-title: A branch‐and‐price approach for harvest scheduling subject to maximum area restrictions publication-title: Computational Optimization and Applications – volume: 49 start-page: 1493 issue: 12 year: 2019 end-page: 1503 article-title: A new mixed‐integer programming model for spatial forest planning publication-title: Canadian Journal of Forest Research – volume: 21 start-page: 15 issue: 1 year: 2016 end-page: 22 article-title: Spatially constrained harvest scheduling for multiple harvests by exact formulation with common matrix algebra publication-title: Journal of Forest Research – volume: 31 start-page: 1 issue: 5 year: 2015 end-page: 34 article-title: Effects of site productivity on forest harvest scheduling subject to green‐up and maximum area restrictions publication-title: Scandinavian Journal of Forest Research – year: 2010 – start-page: 285 year: 2013 end-page: 334 – volume: 161 start-page: 478 issue: 2 year: 2005 end-page: 498 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: 48 start-page: 779 issue: 4 year: 2002 end-page: 789 article-title: Scale and unit specification influences in harvest scheduling with maximum area restrictions publication-title: Forest Science – volume: 176 start-page: 1246 issue: 2 year: 2007 end-page: 1264 article-title: Improving computational capabilities for addressing volume constraints in forest harvest scheduling problems publication-title: European Journal of Operational Research – year: 2008 – volume: 48 start-page: 631 issue: 4 year: 2002 end-page: 642 article-title: Harvest scheduling with area‐based adjacency constraints publication-title: Forest Science – start-page: 279 year: 2003 end-page: 289 – volume: 67 start-page: 587 issue: 5 year: 2021 end-page: 606 article-title: Inter‐temporal aggregation for spatially explicit optimal harvest scheduling under area restrictions publication-title: Forest Science – volume: 33 start-page: 1804 issue: 9 year: 2003 end-page: 1814 article-title: Solving the area‐restricted harvest‐scheduling model using the branch‐and‐bound algorithm publication-title: Canadian Journal of Forest Research – year: 1999 – volume: 48 start-page: 779 issue: 4 year: 2002 ident: e_1_2_8_21_1 article-title: Scale and unit specification influences in harvest scheduling with maximum area restrictions publication-title: Forest Science doi: 10.1093/forestscience/48.4.779 – ident: e_1_2_8_5_1 doi: 10.1287/opre.1070.0472 – ident: e_1_2_8_26_1 doi: 10.1093/forsci/fxab025 – ident: e_1_2_8_4_1 doi: 10.1016/j.ejor.2017.07.060 – volume: 45 start-page: 45 issue: 1 year: 1999 ident: e_1_2_8_20_1 article-title: Spatial restrictions in harvest scheduling publication-title: Forest Science doi: 10.1093/forestscience/45.1.45 – ident: e_1_2_8_16_1 doi: 10.1016/j.ejor.2003.07.021 – ident: e_1_2_8_17_1 doi: 10.4324/9781849774925 – ident: e_1_2_8_10_1 doi: 10.1287/opre.1040.0169 – ident: e_1_2_8_2_1 doi: 10.1007/978-3-642-30671-6_11 – volume: 48 start-page: 631 issue: 4 year: 2002 ident: e_1_2_8_18_1 article-title: Harvest scheduling with area‐based adjacency constraints publication-title: Forest Science doi: 10.1093/forestscience/48.4.631 – ident: e_1_2_8_9_1 doi: 10.1139/cjfr-2019-0152 – volume: 31 start-page: 1 issue: 5 year: 2015 ident: e_1_2_8_3_1 article-title: Effects of site productivity on forest harvest scheduling subject to green‐up and maximum area restrictions publication-title: Scandinavian Journal of Forest Research – volume: 232 start-page: 235 issue: 1 year: 2015 ident: e_1_2_8_11_1 article-title: Spatially explicit forest harvest scheduling with difference equations publication-title: Annals of Operations Research – ident: e_1_2_8_6_1 doi: 10.1139/x03-101 – ident: e_1_2_8_27_1 doi: 10.1007/s10310-015-0507-0 – ident: e_1_2_8_7_1 doi: 10.1007/978-94-017-0307-9_27 – ident: e_1_2_8_14_1 doi: 10.1007/978-3-319-20328-7_14 – ident: e_1_2_8_24_1 – ident: e_1_2_8_8_1 – ident: e_1_2_8_15_1 – ident: e_1_2_8_22_1 doi: 10.5849/forsci.11-040 – ident: e_1_2_8_19_1 doi: 10.5849/forsci.14-179 – ident: e_1_2_8_25_1 doi: 10.1093/forsci/fxy006 – ident: e_1_2_8_13_1 doi: 10.1007/s10589-010-9347-1 – ident: e_1_2_8_12_1 doi: 10.1007/s40725-016-0027-y – ident: e_1_2_8_23_1 doi: 10.1016/j.ejor.2005.09.016 |
| SSID | ssj0001517 |
| Score | 2.3138382 |
| Snippet | This study aims at solving a harvesting scheduling optimization problem with constraints on the clearcut area with additional constraints on clearcut... |
| SourceID | proquest crossref wiley |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 3930 |
| SubjectTerms | branch‐and‐price bucket formulation Connectivity Constraint modelling Dantzig-Wolfe decomposition Environmental impact Harvest Integer programming Mixed integer Net present value Operations research Optimization Scheduling |
| Title | Solving a harvest scheduling optimization problem with constraints on clearcut area and clearcut proximity |
| URI | https://onlinelibrary.wiley.com/doi/abs/10.1111%2Fitor.13183 https://www.proquest.com/docview/2831602700 |
| Volume | 30 |
| WOSCitedRecordID | wos000834265600001&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: PRVWIB databaseName: Wiley Online Library Full Collection 2020 customDbUrl: eissn: 1475-3995 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001517 issn: 0969-6016 databaseCode: DRFUL dateStart: 19970101 isFulltext: true titleUrlDefault: https://onlinelibrary.wiley.com providerName: Wiley-Blackwell |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1RS8MwED50iuiD06k4nRLQF4VKm3RpA76IOhREZW6yt5ImKSpzk20K_ntzXbpNEEF8K21a2uQu99317juAQ1P3w4wa66YalXoh59KTvpVlzmjMg0ykaZ5V-XgT3d7GnY64n4PTohZmzA8xCbihZuT7NSq4TIczSm4FfnASoEjOwwK1glsvwcJFs9G-mezE1prl5dKCCw9pRxw9KWbyTO_-bpCmKHMWq-bGplH-32uuwaoDmeRsLBXrMGd6FVgqctwrUC56ORCn2hVYmSEm3ICXh34XIw1Ekic5QCYOYr1ga5WweJ307Tbz6uo3ietIQzCgSxSiTWw6MRoSe01hTwr1PiLSQlMie3p6BtNnsLbqcxPajcvW-ZXnujJ4ynqzzGNCcRll3MJyP8usdaNcGxpKIaQvdEY1Nz73Vd0YyiKmmWKRhYQ8NNQoBE9sC0q9fs9sA6FpaITKUqaDNOQyjrNIKBVopXVsLaupwlGxNIlylOX4Ed2kcF1wdpN8dqtwMBn7Nibq-HFUrVjhxCnrMLEIK-A-_oGvwnG-lr88Iblu3TXzo52_DN6FZWxUP65irEFpNHg3e7CoPkbPw8G-E9wv_hT0Lw |
| linkProvider | Wiley-Blackwell |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3fT9swED4xQNt4oFvZRPkxLLEXkIKSODjxIwKqopUOlTL1LXJsR2xiLWrDJP577hKnLRKahHiLEidK7Dvfd5e77wC-22M_ykOLbqrVmRcJoTzloywLHiYiyGWWlVmVv7pxr5cMh_LK5eZQLUzFDzELuJFmlPs1KTgFpBe0HCV-chSQTL6DlQjlCAV85azfvunOtmI0Z2W9tBTSI94Rx09KqTzzu59bpDnMXASrpbVpN974np9g3cFMdlLJxWdYsqMmvK-z3JvQqLs5MKfcTVhboCbcgD_X4zuKNTDFbtWEuDgY-sFol6h8nY1xo_nrKjiZ60nDKKTLNOFNajtRTBle09SVQj8UTCE4ZWpk5mcogYaqqx6_wE37fHDa8VxfBk-jP8s9LrVQcS4QmPt5jvYtFMaGkZJS-dLkoRHWF74-tjbkMTdc8xhBoYhsaDXBJ_4Vlkfjkd0EFmaRlTrPuAmySKgkyWOpdWC0MQnaVtuCg3ptUu1Iy-kj7tLaeaHZTcvZbcH-bOx9RdXx4qideolTp67TFDFWIHz6B9-Cw3Ix__OE9GLws18ebb1m8B586Awuu2n3ovdjGz5S2_qqpnEHlovJg92FVf2v-D2dfHNS_ASUrPgf |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8NAEB60iujBR1WszwW9KESSbLrJHkUtFkstvvAWNvtApbalrYL_3p1001YQQbyFZBOS3ZmdbyYz3wAc6aofmVBbN1XLzIsYE57wrSwzGiYsMDzL8qzKx0bcbCZPT7zlcnOwFmbEDzEOuKFm5Ps1KrjuKTOl5Vbi-6cByuQszEXYRaYEcxe3tYfGeCu25iyvl-aMe8g74vhJMZVncvd3izSBmdNgNbc2tZV_vucqLDuYSc5GcrEGM7pThoUiy70MK0U3B-KUuwxLU9SE6_B6121jrIEI8iz6yMVBrB9s7RKWr5Ou3WjeXAUncT1pCIZ0iUS8iW0nhgNir0nsSiHfh0RYcEpER03OYAINVld9bsBD7fL-_MpzfRk8af1Z6lEumYgNs8DcN8bat5ApHUaCc-FzZULFtM98WdU6pDFVVNLYgkIW6VBLhE90E0qdbkdvAQmzSHNpMqqCLGIiSUzMpQyUVCqxtlVX4LhYm1Q60nL8iHZaOC84u2k-uxU4HI_tjag6fhy1Wyxx6tR1kFqMFTAf_8FX4CRfzF-ekNbvb27zo-2_DD6AhdZFLW3Um9c7sIhd60cljbtQGvbf9R7My4_hy6C_74T4Cyye95o |
| 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=Solving+a+harvest+scheduling+optimization+problem+with+constraints+on+clearcut+area+and+clearcut+proximity&rft.jtitle=International+transactions+in+operational+research&rft.au=Martins%2C+Isabel&rft.au=Alvelos%2C+Filipe&rft.au=Cerveira%2C+Adelaide&rft.au=Ka%C5%A1par%2C+Jan&rft.date=2023-11-01&rft.issn=0969-6016&rft.eissn=1475-3995&rft.volume=30&rft.issue=6&rft.spage=3930&rft.epage=3948&rft_id=info:doi/10.1111%2Fitor.13183&rft.externalDBID=10.1111%252Fitor.13183&rft.externalDocID=ITOR13183 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0969-6016&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0969-6016&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0969-6016&client=summon |