Solving the adjacency problem with stand-centred constraints

Solving the adjacency problem with stand-centred constraints

0.00 Avg rating0 Votes
Article ID: iaor2006199
Country: Canada
Volume: 35
Issue: 4
Start Page Number: 832
End Page Number: 842
Publication Date: Apr 2005
Journal: Canadian Journal of Forest Research
Authors: ,
Keywords: programming: linear
Abstract:

We present a new linear integer programing formulation of adjacency constraints for the area restriction model. These constraints are small in number and are a strong model for the adjacency problem. We describe constraint development, including strengthening and lifting, to improve the basic formulation. The model does not prohibit all adjacency violations, but computations show they are few in number. Using example forests ranging from 750 to more than 6000 polygons, optimization problems were solved and good solutions obtained in very short computational time.

Reviews

Required fields are marked *. Your email address will not be published.