Even-aged restrictions with sub-graph adjacency

DOI10.1023/A:1018993822494MaRDI QIDQ1593496zbMATH OpenOpenAlexFDO

Authors T. M. Barrett, J. K. Gilless

Publication date 17 January 2001

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1018993822494

zbMATH Keywords

integer programmingtactical planningheuristic methodsharvest scheduling

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Environmental economics (natural resource models, harvesting, pollution, etc.) (91B76) Integer programming (90C10)

Recommendations

• Constructing And Selecting Adjacency Constraints
• A cutting plane method for solving harvest scheduling models with area restrictions
• A New Mixed-Integer Programming Model for Harvest Scheduling Subject to Maximum Area Restrictions
• Harvest Scheduling Subject to Maximum Area Restrictions: Exploring Exact Approaches
• A multiobjective model for forest planning with adjacency constraints

Cited in

(4)

• A cutting plane method for solving harvest scheduling models with area restrictions
• Integer programming in forestry
• Applying simulated annealing using different methods for the neighborhood search in forest planning problems
• Can mature patch constraints mitigate the fragmenting effects of harvest opening size restrictions?

This page was built for publication: Even-aged restrictions with sub-graph adjacency

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1593496)