Even-aged restrictions with sub-graph adjacency
Even-aged restrictions with sub-graph adjacency
复制标题
具有子图邻接的同龄限制
DOI：
10.1023/a:1018993822494
复制
发表时间：
2000
影响因子：
4.8
通讯作者：
J. Gilless
中科院分区：
文献类型：
--
作者：
T. Barrett;J. Gilless
限制的大小和接近的皆伐，导致了各种精确的和启发式的方法来优化木材收获的净现值的发展，受相邻约束。大多数将收获单元视为预定义的，并对共享公共边界的任何两个单元施加相邻约束。通过使用图论符号来定义子图邻接约束，开口大小可以被认为是可变的，这可能更适合于车间级规划。本文用一个小的例子数据集来说明整数规划和启发式求解方法中两种类型的邻接约束之间的区别。
Restrictions on the size and proximity of clearcuts have led to the development of a variety of exact and heuristic methods to optimize the net present value of timber harvests, subject to adjacency constraints. Most treat harvest units as pre-defined, and impose adjacency constraints on any two units sharing a common border. By using graph theory notation to define sub-graph adjacency constraints, opening size can be considered variable, which may be more appropriate for landscape-level planning. A small example data set is used in this paper to demonstrate the difference between the two types of adjacency constraints for both integer programming and heuristic solution methods.
平面图：理论与算法
DOI：
--
发表时间：
2008
期刊：
影响因子：
--
作者：
花谷嘉一;太田和夫;T. Nishizeki and N. Chiba
通讯作者：
T. Nishizeki and N. Chiba