作者: Alan T. Murray , Richard L. Church
DOI: 10.1080/03155986.1996.11732306
关键词: Small number 、 Mathematical optimization 、 Range (mathematics) 、 Adjacency list 、 Constraint aggregation 、 Selection (relational algebra) 、 Class (computer programming) 、 Constraint (information theory) 、 Mathematics
摘要: AbstractMaintaining spatial integrity is an important concern in both the tactical and operational levels of forestry planning. Spatial relationships are typically represented by adjacency constraints. The number needed constraints for even a small planning units, if not kept to minimum, may be too large include mathematical programming formulation. Several approaches have been developed “minimize” used. These involve either constraint subset selection or aggregation. We demonstrate that with aggregation theoretical minimum necessary one. However, range coefficients one aggregated impractical actual application. As alternative, we explore approach identifying minimal class structural part this approach, develop two-stage procedure identify fine tune subse...