A short proof of optimality of the bottom up algorithm for discrete resource allocation problems

Operations Research Letters

Volumn 21, Issue 2, 1997, Pages 81-85

  Zaporozhets, A ^a  

^a BELARUSIAN STATE UNIVERSITY   (Belarus)

Author keywords

Greedy algorithm; Integer programming; Polymatroid; Resource allocation problem

Indexed keywords

EID: 0042634029     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(97)00026-6     Document Type: Article

References (10)

1. M.E. Dyer, A.M. Frieze, On an optimization problem with nested constraints, Discrete Appl. Math. 26 (1990) 159-173.
2. J. Edmonds, Submodular functions, matroids and certain polyhedra, in: R. Guy et al. (Eds.) Combinatorial Structures and their Applications, Gordon and Breach, New York, 1970, pp. 69-87.
3. A. Federgruen, H. Groenevelt, The greedy procedure for resource allocation problems: necessary and sufficient conditions for optimality, Oper. Res. 34 (1986) 909-918.
4. G.N. Frederickson, D.B. Johnson, The complexity of selection and ranking in X + Y and matrices with sorted columns, J. Comput. System Sci. 24 (1982) 197-208.
5. S. Fujishige, Submodular functions and optimization, Annals of Discrete Mathematics, vol. 47, Elsevier, Amsterdam, 1991.
6. E. Girlich, M. Kowaljow, Nichtlineare Diskrete Optimierung, Akademie-Verlag, Berlin, 1981.
7. N. Glebov, About one class of convex programming problems, Controlled Systems (Upravlyaemye Systemy) 11 (1973) 38-42 (in Russian).
8. H. Groenevelt, Two algorithms for maximizing a separable concave function over a polymatroid feasible region, Eur. J. Oper. Res. 54 (1991) 227-236.
9. T. Ibaraki, N. Katoh, Resource Allocation Problems: Algorithmic Approaches, MIT Press, Boston, 1988.
10. D.S. Hochbaum, Lower and upper bounds for the allocation problem and other nonlinear optimization problems, Math. Oper. Res. 19 (1994) 390-409.