On Marginal Allocation in Single Constraint Min-Max Problems
From MaRDI portal
Cited in
(7)- Minimization of maximum absolute deviation in integers
- Composing batches with yield uncertainty
- Min-max optimization of several classical discrete optimization problems
- Heuristic and reduction algorithms for the knapsack sharing problem
- Comparative error bound theory for three location models: continuous demand versus discrete demand
- Fairness over time in dynamic resource allocation with an application in healthcare
- Solving knapsack sharing problems with general tradeoff functions
This page was built for publication: On Marginal Allocation in Single Constraint Min-Max Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5630879)