Spatially constrained timber harvest scheduling

Abstract
Multiple-use management forests of often requires imposition of spatial constraints on the selection of units for harvest. To satisfy such constraints, harvest units must be treated as integral units. A biased sampling search technique is used to find integer solutions to operationally sized problems. Solutions found for the sample problems are within 8% of the upper bound of the corresponding linear programming solution and less than 4% below the upper bound on the true optimum as defined by a confidence interval estimator.

This publication has 2 references indexed in Scilit: