Solving the adjacency problem with stand-centred constraints

$50.00 plus tax (Refund Policy)

Buy Article:

Abstract:

We present a new linear integer programming 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.

Les auteurs présentent une nouvelle formulation des contraintes d'adjacence avec la programmation linéaire par nombres entiers pour le modèle de restriction de surface. Ces contraintes sont peu nombreuses et constituent un modèle puissant pour résoudre le problème d'adjacence. Ils décrivent l'élaboration des contraintes, incluant leur renforcement et leur remodelage, pour améliorer la formulation de base. Le modèle n'élimine pas toutes les violations d'adjacence, mais les calculs effectués démontrent qu'elles sont peu nombreuses. Des problèmes d'optimisation ont été résolus pour des forêts constituées de 750 à plus de 6000 polygones et ils ont obtenu de bonnes solutions avec un temps de calcul très court.[Traduit par la Rédaction]

Document Type: Research Article

Publication date: April 1, 2005

More about this publication?
  • Published since 1971, this monthly journal features articles, reviews, notes and commentaries on all aspects of forest science, including biometrics and mensuration, conservation, disturbance, ecology, economics, entomology, fire, genetics, management, operations, pathology, physiology, policy, remote sensing, social science, soil, silviculture, wildlife and wood science, contributed by internationally respected scientists. It also publishes special issues dedicated to a topic of current interest.
  • Information for Authors
  • Submit a Paper
  • Subscribe to this Title
  • Terms & Conditions
  • Sample Issue
  • Reprints & Permissions
  • ingentaconnect is not responsible for the content or availability of external websites
Related content

Tools

Favourites

Share Content

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
X
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