Skip to main content

The Grid Packing Problem: Selecting a Harvesting Pattern in an Area with Forbidden Regions

Buy Article:

$29.50 plus tax (Refund Policy)


The problem of determining the maximum value or maximum volume cutting pattern in a forested area which is divided into a regular grid is approached as a 0-1 integer programming model. Constraints are included to preclude harvests in blocks which are adjacent to one another in an effort to reduce large forest openings which can have negative environmental impacts. One form of adjacency constraints can be used to exclude the cutting of blocks which share a common edge. Other forms can prevent harvesting blocks which share an edge or point. The challenge is to write these constraints in a form that favors 0-1 solutions. The integer-friendly forms that are chosen are applied to large tracts of land in which significant areas are excluded from cutting because of habitat preservation requirements or other prohibitions. More than 100 experimental runs with hypothetical data were conducted. For. Sci. 42(1):27-34.

Keywords: Harvest adjacency constraints; integer programming; nonharvestable regions; optimization

Document Type: Journal Article

Affiliations: The Johns Hopkins University, Department of Geography and Environmental Engineering, 313 Ames Hall, Baltimore, MD 21218

Publication date: February 1, 1996

More about this publication?
  • Membership Information
  • ingentaconnect is not responsible for the content or availability of external websites

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more