Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints
type: Item
instance of: scholarly article
title: Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints
zbMATH Open document ID: 1374.90435
author: Isabel Martins
author: Miguel Constantino
published in: European Journal of Operational Research
publication date: 2017-11-23T00:00:00Z
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B90
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6811869
zbMATH Keywords: OR in natural resources
zbMATH Keywords: forest management
zbMATH Keywords: integer programming
zbMATH Keywords: cutting plane
describes a project that uses: FRAGSTATS
describes a project that uses: ABACUS
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: j.ejor.2017.07.060
OpenAlex ID: W2744157975
cites work: Imposing Connectivity Constraints in Forest Planning Models
cites work: A New Mixed-Integer Programming Model for Harvest Scheduling Subject to Maximum Area Restrictions
cites work: Q4735939
cites work: Dioïds and semirings: Links to fuzzy sets and other applications
cites work: Harvest Scheduling Subject to Maximum Area Restrictions: Exploring Exact Approaches
cites work: A cutting plane method for solving harvest scheduling models with area restrictions
cites work: A branch-and-price approach for harvest scheduling subject to maximum area restrictions
cites work: A column generation approach for solving a non-temporal forest harvest model with spatial structure constraints
cites work: Modeling target volume flows in forest harvest scheduling subject to maximum area restrictions
cites work: A branch-and-bound procedure for forest harvest scheduling problems addressing aspects of habitat availability
cites work: Forest harvest scheduling with clearcut and core area constraints
cites work: Can mature patch constraints mitigate the fragmenting effects of harvest opening size restrictions?
cites work: Multiobjective grid packing model: An application in forest management
cites work: Reserve assemblage of critical areas: A zero-one programming approach
cites work: Q4254875
cites work: Modeling forest core area with integer programming
DOI: 10.1016/J.EJOR.2017.07.060
Recommended article: Forest harvest scheduling with clearcut and core area constraints
Recommended article: A branch-and-bound procedure for forest harvest scheduling problems addressing aspects of habitat availability
Recommended article: Solving a harvest scheduling optimization problem with constraints on clearcut area and clearcut proximity
Recommended article: Improving computational capabilities for addressing volume constraints in forest harvest scheduling problems
Recommended article: SCHEDULING THE HARVESTING OPERATIONS OF A FOREST BLOCK: A CASE STUDY
Recommended article: Spatially explicit forest harvest scheduling with difference equations
Recommended article: A multi-objective Monte Carlo tree search for forest harvest scheduling
Recommended article: A branch-and-price approach for harvest scheduling subject to maximum area restrictions
Recommended article: Review of combinatorial problems induced by spatial forest harvesting planning
Recommended article: Modeling target volume flows in forest harvest scheduling subject to maximum area restrictions
description: scientific article; zbMATH DE number 6811869