Technical Note—Integer Allocation Problems of Min-Max Type with Quasiconvex Separable Functions
From MaRDI portal
Publication:3902824
DOI10.1287/opre.29.1.207zbMath0454.90050MaRDI 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 conditions; solution algorithm; min-max criterion; min-max type; bottleneck integer problems; integer allocation problems; integer resource allocations; quasiconvex separable functions
Related Items
Quasiconcave functions over chains†, Solving knapsack sharing problems with general tradeoff functions, Sharing problems