Even-aged restrictions with sub-graph adjacency

T.M. Barrett () and J.K. Gilless ()

Annals of Operations Research, 2000, vol. 95, issue 1, 159-175

Abstract: Restrictions on the size and proximity of clearcuts have led to the development of a variety of exact and heuristic methods to optimize the net present value of timber harvests, subject to adjacency constraints. Most treat harvest units as pre-defined, and impose adjacency constraints on any two units sharing a common border. By using graph theory notation to define sub-graph adjacency constraints, opening size can be considered variable, which may be more appropriate for landscape-level planning. A small example data set is used in this paper to demonstrate the difference between the two types of adjacency constraints for both integer programming and heuristic solution methods. Copyright Kluwer Academic Publishers 2000

Keywords: harvest scheduling; integer programming; tactical planning; heuristic methods (search for similar items in EconPapers)
Date: 2000
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018993822494 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:95:y:2000:i:1:p:159-175:10.1023/a:1018993822494

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018993822494

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().