Minimax Resource Allocation Problems with Resource-Substitutions Represented by Graphs
DOI10.1287/OPRE.41.5.959zbMATH Open0797.90037OpenAlexW2023691153MaRDI QIDQ4286474FDOQ4286474
Authors: Rachelle S. Klein, Hanan Luss, Uriel G. Rothblum 
Publication date: 6 April 1994
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.41.5.959
Recommendations
- Minimax Resource Allocation with Tree Structured Substitutable Resources
- A min-max resource allocation problem with substitutions
- Multiperiod allocation of substitutable resources
- A Multiperiod Minimax Resource Allocation Problem with Substitutable Resources
- scientific article; zbMATH DE number 3845343
limited resourcesmax-flow algorithmcompeting activitiesrelaxed minimax problemsubstitutions among resources
Deterministic scheduling theory in operations research (90B35) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Production models (90B30)
Cited In (11)
- Minimax Resource Allocation with Tree Structured Substitutable Resources
- A Multiperiod Minimax Resource Allocation Problem with Substitutable Resources
- Bounded knapsack sharing
- A min-max resource allocation problem with substitutions
- Monitoring and limiting deceptive counterfeiting: a two-stage model
- Lexicographic multi-period resources allocation problem with weighted substitutable resources
- Multiperiod allocation of substitutable resources
- Relaxation-based algorithms for minimax optimization problems with resource allocation applications
- Min-max optimization of several classical discrete optimization problems
- Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
- Fair optimization and networks: a survey
This page was built for publication: Minimax Resource Allocation Problems with Resource-Substitutions Represented by Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4286474)
