Technical Note—On Min-Max Integer Allocation Problems

Tetsuo Ichimori
Additional contact information
Tetsuo Ichimori: Hiroshima University, Higashi Hiroshima, Hiroshima, Japan

Operations Research, 1984, vol. 32, issue 2, 449-450

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 (search for similar items in EconPapers)
Date: 1984
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.32.2.449 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:32:y:1984:i:2:p:449-450

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().