A column generation approach for solving a non-temporal forest harvest model with spatial structure constraints

DOI10.1016/j.ejor.2003.07.021zbMath1067.90119OpenAlexW1976572228WikidataQ58647749 ScholiaQ58647749MaRDI QIDQ1887939

Isabel Martins, José G. Borges, Miguel Fragoso Constantino

Publication date: 22 November 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2003.07.021

zbMATH Keywords

Integer programmingHeuristicsColumn generationNatural resourcesPatch size constraints

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Operations research and management science (90B99)

Related Items

A column generation approach for solving a non-temporal forest harvest model with spatial structure constraints ⋮ Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints ⋮ Forest harvest scheduling with clearcut and core area constraints ⋮ Solving a harvest scheduling optimization problem with constraints on clearcut area and clearcut proximity ⋮ A branch-and-price approach for harvest scheduling subject to maximum area restrictions ⋮ Modeling target volume flows in forest harvest scheduling subject to maximum area restrictions ⋮ Management of the risk of wind damage in forestry: a graph-based Markov decision process approach ⋮ Review of combinatorial problems induced by spatial forest harvesting planning ⋮ A multi-objective Monte Carlo tree search for forest harvest scheduling ⋮ A branch-and-bound procedure for forest harvest scheduling problems addressing aspects of habitat availability ⋮ A cutting plane method for solving harvest scheduling models with area restrictions

Uses Software

• CPLEX

Cites Work

• The Steiner tree problem
• A column generation approach for solving a non-temporal forest harvest model with spatial structure constraints
• Heuristic solution approaches to operational forest planning problems
• Dioïds and semirings: Links to fuzzy sets and other applications
• Steiner trees, partial 2–trees, and minimum IFI networks
• The Rectilinear Steiner Tree Problem is $NP$-Complete
• Constructing And Selecting Adjacency Constraints
• Unnamed Item
• Unnamed Item
• Unnamed Item