Technical Note—On Min-Max Integer Allocation Problems

DOI10.1287/opre.32.2.449zbMath0536.90066OpenAlexW2035262750MaRDI QIDQ3321840

Tetsuo Ichimori

Publication date: 1984

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

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

zbMATH Keywords

minmax optimizationbottleneck integer allocation problem

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (3)

Continuous maximin knapsack problems with GLB constraints ⋮ Min-max optimization of several classical discrete optimization problems ⋮ Solving knapsack sharing problems with general tradeoff functions

This page was built for publication: Technical Note—On Min-Max Integer Allocation Problems