Constructing And Selecting Adjacency Constraints

DOI10.1080/03155986.1996.11732306zbMATH Open0864.90078OpenAlexW83388600MaRDI QIDQ5689643FDOQ5689643

Authors: Alan T. Murray, Richard L. Church 

Publication date: 22 June 1997

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03155986.1996.11732306

Recommendations

• Imposing Connectivity Constraints in Forest Planning Models
• A cutting plane method for solving harvest scheduling models with area restrictions
• Harvest Scheduling Subject to Maximum Area Restrictions: Exploring Exact Approaches
• A New Mixed-Integer Programming Model for Harvest Scheduling Subject to Maximum Area Restrictions

zbMATH Keywords

constraint aggregationadjacency constraintsforestry planningconstraint subset selection

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Case-oriented studies in operations research (90B90) Integer programming (90C10)

Cited In (8)

• Principles and Practice of Constraint Programming – CP 2003
• Even-aged restrictions with sub-graph adjacency
• A column generation approach for solving a non-temporal forest harvest model with spatial structure constraints
• Adjacency on the constrained assignment problem
• Solving the anti-covering location problem using Lagrangian relaxation
• Forest management challenges for operational researchers
• Minimization of the Wood Density Variation in Pulp and Paper Production
• Lagrangean relaxation with clusters for point-feature cartographic label placement problems

This page was built for publication: Constructing And Selecting Adjacency Constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5689643)