Technical Note—Integer Allocation Problems of Min-Max Type with Quasiconvex Separable Functions

From MaRDI portal

Revision as of 21:26, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3902824

Jump to:navigation, search

DOI10.1287/opre.29.1.207zbMath0454.90050OpenAlexW2039819264MaRDI QIDQ3902824

Zeev Zeitlin

Publication date: 1981

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.29.1.207

zbMATH Keywords

optimality conditions solution algorithm min-max criterion min-max type bottleneck integer problems integer allocation problems integer resource allocations quasiconvex separable functions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items (3)

Sharing problems ⋮ Quasiconcave functions over chains^† ⋮ Solving knapsack sharing problems with general tradeoff functions

This page was built for publication: Technical Note—Integer Allocation Problems of Min-Max Type with Quasiconvex Separable Functions

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3902824&oldid=17555217"