Author:
Girlich E.,Kovalev M.,Zaporozhets A.
Publisher
Springer Berlin Heidelberg
Reference6 articles.
1. Dyer, M.E. and Frieze, A.M., “On an optimization problem with nested constraints”, Discrete Applied Mathematics 26 (1990) 159–173.
2. Frederickson, G.N. and Johnson, D.B., “The complexity of selection and ranking in X + Y and matrices with sorted columns”, Journal on Computer and System Science 24 (1982) 197–208.
3. Girlich, E., Kovalev, M., and Zaporozhets, A., M Polynomial Algorithm for Resource Allocation Problems with Polymatroid Constraints”, Preprint Nr. 2/95, Fakultät für Mathematik, Otto-von-Guericke-Universität, Magdeburg, 1995.
4. Glebov, N., “About one class of convex programming problems”, Controlled Systems (Upravlyaemye Systemy) 11 (1973) 38–42 (in Russian).
5. Groenevelt, H., “Two algorithms for maximizing a separable concave function over a polymatroid feasible region”, European Journal of Operations Research 54 (1991) 227–236.