Modeling forest core area with integer programming
From MaRDI portal
(Redirected from Publication:666471)
Recommendations
- Imposing Connectivity Constraints in Forest Planning Models
- Forest harvest scheduling with clearcut and core area constraints
- Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints
- A New Mixed-Integer Programming Model for Harvest Scheduling Subject to Maximum Area Restrictions
- Design and Implementation of an Interactive Optimization System for Telephone Network Planning
Cites work
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- A New Mixed-Integer Programming Model for Harvest Scheduling Subject to Maximum Area Restrictions
- A tabu search algorithm for finding good forest harvest schedules satisfying green-up constraints
- Can mature patch constraints mitigate the fragmenting effects of harvest opening size restrictions?
- Review of combinatorial problems induced by spatial forest harvesting planning
Cited in
(9)- Allocating reforestation areas for sediment flow minimization: an integer programming formulation and~a~heuristic solution method
- Forest harvest scheduling with clearcut and core area constraints
- Optimal selection of forest patches using integer and fractional programming
- Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints
- Design and Implementation of an Interactive Optimization System for Telephone Network Planning
- Imposing Connectivity Constraints in Forest Planning Models
- A multi-objective Monte Carlo tree search for forest harvest scheduling
- Modeling harvest scheduling in multifunctional planning of forests for longterm water yield optimization
- Modeling alternative zoning strategies in forest management
This page was built for publication: Modeling forest core area with integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q666471)
