Minimax Resource Allocation with Tree Structured Substitutable Resources

DOI10.1287/opre.39.2.285zbMath0728.90078OpenAlexW1970552375MaRDI QIDQ3352858

Rachelle S. Klein, Hanan Luss

Publication date: 1991

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

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

zbMATH Keywords

minimax algorithmtree structurescompeting activities

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonlinear programming (90C30) Production models (90B30) Existence of solutions for minimax problems (49J35) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (7)

Relaxation-based algorithms for minimax optimization problems with resource allocation applications ⋮ CMIT, capacitated multi-level implosion tool ⋮ Multiperiod allocation of substitutable resources ⋮ A nonlinear minimax allocation problem with multiple knapsack constraints ⋮ Minimax resource allocation problems: Optimization and parametric analysis ⋮ Bounded knapsack sharing ⋮ Fair optimization and networks: a survey

This page was built for publication: Minimax Resource Allocation with Tree Structured Substitutable Resources