On the extremal parameter grouping in problems of weighed graphs

The relation is investigated of the problem of extremal parameter groping and that of minimizing the positive definite quadratic form on the set of vertices of a $k$-dimensional hypercube with module one coordinates. The latter problem is found reducible to search of a minimal negative section of the weighed graph. A heuristical algorithm for solution of this problem is described and indirectly justified.