Technical Note—Integer Allocation Problems of Min-Max Type with Quasiconvex Separable Functions
Published Online:1 Feb 1981https://doi.org/10.1287/opre.29.1.207
- Cited by
- 1 June 1999 | Operations Research, Vol. 47, No. 3
- European Journal of Operational Research, Vol. 106, No. 1
- Mathematical Programming, Vol. 51, No. 1-3
- 21 November 2006 | Naval Research Logistics Quarterly, Vol. 29, No. 4
Volume 29, Issue 1
January-February 1981
Pages 1-211
Article Information
Metrics
Information
- Published Online:February 01, 1981
© 1981 INFORMS
Cite as
Zeev Zeitlin, (1981) Technical Note—Integer Allocation Problems of Min-Max Type with Quasiconvex Separable Functions. Operations Research 29(1):207-211.
https://doi.org/10.1287/opre.29.1.207
