Technical Note—On Min-Max Integer Allocation Problems
- 1 April 1984
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 32 (2) , 449-450
- https://doi.org/10.1287/opre.32.2.449
Abstract
This note treats a bottleneck integer allocation problem. The results obtained supercede those in this Journal due to Zeitlin (Zeitlin, Z. 1981. Integer allocation problems of min-max type with quasiconvex separable functions. Opns. Res. 29 207–211.), who has considered a similar allocation problem with a strictly quasiconvex objective function.Keywords
This publication has 0 references indexed in Scilit: