Technical Note—Integer Allocation Problems of Min-Max Type with Quasiconvex Separable Functions
From MaRDI portal
Publication:3902824
DOI10.1287/opre.29.1.207zbMath0454.90050OpenAlexW2039819264MaRDI QIDQ3902824
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
optimality conditionssolution algorithmmin-max criterionmin-max typebottleneck integer problemsinteger allocation problemsinteger resource allocationsquasiconvex separable functions
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