Skid trail network simulation by means of hypernetwork covered with weighted rooted tree

Бесплатный доступ

The article is concerned with the description of the skid trail network on the cutting area. The analysis of the existing methods of solving the problem is carried out. A new approach to solving the hypernetwork problem is suggested. The two level mathematical model ofthe hypernetwork is presented. The solution algorithm of the problem of the minimum weighted rooted tree cover is considered.

Hypergraph, hypernetwork, rooted tree cover of hypernetwork, optimization, skid trail

Короткий адрес: https://sciup.org/14750089

IDR: 14750089

Статья научная