The problem idscussed in this paper stems from the mining network problem that asks for shortest drive network N connecting a number of ore deposits to a known vertica shaft L. In practive, the gradients of the drives are restricted to some maximum value. In general N can be regarded as a union of two subnetworks N sub 1, N sub 2 so that they join L either separately or through a steiner point. If the diameters of N sub 1, N sub 2 are comparatively smaller than the distances between N sub 1, N sub 2 and L, then N sub 1, N sub 2 can be treated as two points. Therefore, the simplest model of the mining network is a shortest network N that joins two points to a vertical line with gradient ocnstrained edges.
展开▼
机译：本文中讨论的问题源于采矿网络问题，该问题要求最短的驱动网络N将大量矿床连接到已知的垂直竖井L。实际上，驱动器的梯度被限制在某个最大值。通常，N可以看作是两个子网N sub 1，N sub 2的并集，因此它们分别或通过斯坦纳点加入L。如果N sub 1的直径，N sub 2的直径相对小于N sub 1，N sub 2和L之间的距离，则N sub 1，N sub 2可以视为两个点。因此，采矿网络的最简单模型是最短网络N，该网络将两个点连接到具有梯度约束边缘的垂直线。
展开▼
