Technical Note—On Min-Max Integer Allocation Problems | Zendy

Tetsuo Ichimori | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Technical Note—On Min-Max Integer Allocation Problems

Author(s) -

Tetsuo Ichimori

Publication year - 1984

Publication title -

operations research

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 3.797

H-Index - 140

eISSN - 1526-5463

pISSN - 0030-364X

DOI - 10.1287/opre.32.2.449

Subject(s) - quasiconvex function , separable space , bottleneck , integer (computer science) , mathematical optimization , function (biology) , integer programming , mathematics , combinatorics , computer science , mathematical economics , regular polygon , convex optimization , convex analysis , evolutionary biology , programming language , biology , embedded system , mathematical analysis , geometry

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 quas...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research