TASK OF A COVERING HYPERNETWORK BY WEIGHTED SPANNING TREE AND ITS APPLICATION FOR OPTIMAL SKID TRAILS NETWORK DESIGNING ON CUTTING AREAS
The article presents a description of the skid trail network designing on the cutting area. Analysis for existing mathematical methods of the decision is carried out. New approach is offered. The approach is concerned with usage of a hyper-network. The mathematical model in the form of a two-level hyper-network is set out. The algorithm for the task decision of a covering hyper-network by minimum weighted spanning tree is offered. An example is shown.
Keywords: hyper-graph, hyper-network, weighted spanning tree of hyper-network, optimization, skid trail.
