On Marginal Allocation in Single Constraint Min-Max Problems
From MaRDI portal
Publication:5630879
DOI10.1287/mnsc.17.11.780zbMath0224.90086OpenAlexW1977385613MaRDI QIDQ5630879
Publication date: 1971
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.17.11.780
Related Items
Heuristic and reduction algorithms for the knapsack sharing problem ⋮ Fairness over time in dynamic resource allocation with an application in healthcare ⋮ Minimization of maximum absolute deviation in integers ⋮ Comparative error bound theory for three location models: continuous demand versus discrete demand ⋮ Composing batches with yield uncertainty ⋮ Min-max optimization of several classical discrete optimization problems ⋮ Solving knapsack sharing problems with general tradeoff functions