Technical Note—On Min-Max Integer Allocation Problems

Operations Research · 1984 · Volume 32 · Issue 2

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

633 bottleneck allocation problem

Enable JavaScript for citation tools and additional paper interactions.