by Girlich, E., Kovalev, M., Zaporozhets, A..
Series: 1995-02, Preprints
We present the Dichotomic Greedy Algorithm (DGA) for the fol-
lowing resource allocation problem: maximize a separable concave
function of a profit over a set of feasible allocations formed by integer
points of a polymatroid.It is proved that the running time of DGA
is polynomially bounded. The implementation of DGA for several
special types of polymatroid feasible sets is analysed.