More on Min-Max Allocation

DOI10.1287/MNSC.18.9.502MaRDI QIDQ5665018zbMATH OpenOpenAlexFDO

Authors Evan L. Porteus, Jonathan S. Yormark

Publication date 1972

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.18.9.502

Mathematics Subject Classification ID

Integer programming (90C10)

Cited in

(6)

• Heuristic and reduction algorithms for the knapsack sharing problem
• A resource allocation problem on timed marked graphs: a decomposition approach
• Comparative error bound theory for three location models: continuous demand versus discrete demand
• Min-max optimization of several classical discrete optimization problems
• Solving knapsack sharing problems with general tradeoff functions
• Fairness over time in dynamic resource allocation with an application in healthcare

This page was built for publication: More on Min-Max Allocation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5665018)