by Girlich, E., Pisaruk, N.N..
Series: 1997-42, Preprints
The primal simplex method is applied for solving the problem of
minimizing a submodular function. As far as we know this is the first
primal algorithm for the problem. In  and  the dual simplex
method was applied for solving the problem. Here we prove that the
both methods are finite. Computational experiments show that these
methods are the methods of choise for using in practice.
minimization, submodular function, simplex method