Two algorithms for maximizing a separable concave function over a polymatroid feasible region
Author:
- H. GroeneveltHGH. Groenevelt
Open Access
- 1 September 1991
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 54 (2) , 227-236
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- Polymatroidal flow network models with multiple sinksNetworks, 1988
- A 98%-Effective Lot-Sizing Rule for a Multi-Product, Multi-Stage Production / Inventory SystemMathematics of Operations Research, 1986
- The Partial Order of a Polymatroid Extreme PointMathematics of Operations Research, 1985
- Adjacency on polymatroidsMathematical Programming, 1984
- Activity selection games and the minimum-cut problemNetworks, 1983
- Solution techniques for some allocation problemsMathematical Programming, 1983
- Optimal sharingMathematical Programming, 1982
- The complexity of selection and ranking in X + Y and matrices with sorted columnsJournal of Computer and System Sciences, 1982
- Efficient Algorithms for a Selection Problem with Nested Constraints and Its Application to a Production-Sales Planning ModelSIAM Journal on Control and Optimization, 1980
- Optimal flows in networks with multiple sources and sinksMathematical Programming, 1974