Optimal harvest cluster size with increasing opening costs for harvest sites
Author
Abstract
Suggested Citation
DOI: 10.1016/j.forpol.2016.11.012
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Gianni Codato & Matteo Fischetti, 2006. "Combinatorial Benders' Cuts for Mixed-Integer Linear Programming," Operations Research, INFORMS, vol. 54(4), pages 756-766, August.
- Hoen, Hans Fredrik & Eid, Tron & Okseter, Petter, 2006. "Efficiency gains of cooperation between properties under varying target levels of old forest area coverage," Forest Policy and Economics, Elsevier, vol. 8(2), pages 135-148, March.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Augustynczik, Andrey Lessa Derci & Yousefpour, Rasoul & Rodriguez, Luiz Carlos Estraviz & Hanewinkel, Marc, 2018. "Conservation Costs of Retention Forestry and Optimal Habitat Network Selection in Southwestern Germany," Ecological Economics, Elsevier, vol. 148(C), pages 92-102.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Elisangela Martins de Sá & Ivan Contreras & Jean-François Cordeau & Ricardo Saraiva de Camargo & Gilberto de Miranda, 2015. "The Hub Line Location Problem," Transportation Science, INFORMS, vol. 49(3), pages 500-518, August.
- Yossiri Adulyasak & Jean-François Cordeau & Raf Jans, 2015. "Benders Decomposition for Production Routing Under Demand Uncertainty," Operations Research, INFORMS, vol. 63(4), pages 851-867, August.
- Jérémy Omer & Michael Poss, 2021. "Identifying relatively irreducible infeasible subsystems of linear inequalities," Annals of Operations Research, Springer, vol. 304(1), pages 361-379, September.
- Maher, Stephen J., 2021. "Implementing the branch-and-cut approach for a general purpose Benders’ decomposition framework," European Journal of Operational Research, Elsevier, vol. 290(2), pages 479-498.
- William B. Haskell & Wenjie Huang & Huifu Xu, 2018. "Preference Elicitation and Robust Optimization with Multi-Attribute Quasi-Concave Choice Functions," Papers 1805.06632, arXiv.org.
- Clavijo López, Christian & Crama, Yves & Pironet, Thierry & Semet, Frédéric, 2024. "Multi-period distribution networks with purchase commitment contracts," European Journal of Operational Research, Elsevier, vol. 312(2), pages 556-572.
- Avci, Mualla Gonca & Avci, Mustafa & Battarra, Maria & Erdoğan, Güneş, 2024. "The wildfire suppression problem with multiple types of resources," European Journal of Operational Research, Elsevier, vol. 316(2), pages 488-502.
- David Bergman & Carlos H. Cardonha & Andre A. Cire & Arvind U. Raghunathan, 2019. "On the Minimum Chordal Completion Polytope," Operations Research, INFORMS, vol. 67(2), pages 532-547, March.
- Dell’Amico, Mauro & Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2019. "Mathematical models and decomposition methods for the multiple knapsack problem," European Journal of Operational Research, Elsevier, vol. 274(3), pages 886-899.
- Belieres, Simon & Hewitt, Mike & Jozefowiez, Nicolas & Semet, Frédéric & Van Woensel, Tom, 2020. "A Benders decomposition-based approach for logistics service network design," European Journal of Operational Research, Elsevier, vol. 286(2), pages 523-537.
- Mancini, Simona & Ciavotta, Michele & Meloni, Carlo, 2021. "The Multiple Multidimensional Knapsack with Family-Split Penalties," European Journal of Operational Research, Elsevier, vol. 289(3), pages 987-998.
- Dursun, Pınar & Taşkın, Z. Caner & Altınel, İ. Kuban, 2019. "The determination of optimal treatment plans for Volumetric Modulated Arc Therapy (VMAT)," European Journal of Operational Research, Elsevier, vol. 272(1), pages 372-388.
- Weckenborg, Christian & Schumacher, Patrick & Thies, Christian & Spengler, Thomas S., 2024. "Flexibility in manufacturing system design: A review of recent approaches from Operations Research," European Journal of Operational Research, Elsevier, vol. 315(2), pages 413-441.
- Schulz, Arne & Pfeiffer, Christian, 2024. "Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems," European Journal of Operational Research, Elsevier, vol. 312(2), pages 456-472.
- Rahmaniani, Ragheb & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2017. "The Benders decomposition algorithm: A literature review," European Journal of Operational Research, Elsevier, vol. 259(3), pages 801-817.
- Michels, Adalberto Sato & Lopes, Thiago Cantos & Magatão, Leandro, 2020. "An exact method with decomposition techniques and combinatorial Benders’ cuts for the type-2 multi-manned assembly line balancing problem," Operations Research Perspectives, Elsevier, vol. 7(C).
- Moira MacNeil & Merve Bodur, 2022. "Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 297-314, January.
- Matteo Fischetti & Domenico Salvagnin, 2010. "Pruning Moves," INFORMS Journal on Computing, INFORMS, vol. 22(1), pages 108-119, February.
- Rodríguez, Jesús A. & Anjos, Miguel F. & Côté, Pascal & Desaulniers, Guy, 2021. "Accelerating Benders decomposition for short-term hydropower maintenance scheduling," European Journal of Operational Research, Elsevier, vol. 289(1), pages 240-253.
- Senna, Fernando & Coelho, Leandro C. & Morabito, Reinaldo & Munari, Pedro, 2024. "An exact method for a last-mile delivery routing problem with multiple deliverymen," European Journal of Operational Research, Elsevier, vol. 317(2), pages 550-562.
More about this item
Keywords
Strategic/tactical forest planning; Natural resources; Integer programming; Tradeoffs; Spatial; Biomass;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:forpol:v:75:y:2017:i:c:p:49-57. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/forpol .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.