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

DOI10.1287/OPRE.29.1.207MaRDI QIDQ3902824zbMATH OpenOpenAlexFDO

Authors 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 conditionssolution algorithmmin-max criterionmin-max typebottleneck integer problemsinteger allocation problemsinteger resource allocationsquasiconvex separable functions

Mathematics Subject Classification ID

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

Cited in

(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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3902824)