A graphical method to solve a family of allocation problems
From MaRDI portal
Publication:791448
DOI10.1016/0377-2217(84)90005-5zbMath0535.90083OpenAlexW1987812542MaRDI QIDQ791448
Publication date: 1984
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(84)90005-5
Related Items (8)
A graphical method to solve a maximin allocation problem ⋮ A graphical bicriteria approach to the resource allocation problem ⋮ An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives ⋮ Assessing reliability of modular software ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ Minmax linear knapsack problem with grouped variables and gub ⋮ Asignacion de recuerdos max-min: Propiedades y algoritmos ⋮ Alternatives for reliable and quality telecommunication network design
Cites Work
- On Reducing a Resource Allocation Problem to a Single One-Dimensional Minimization of a Differentiable Convex Function
- Technical Note—Allocation of Effort Resources among Competing Activities
- On an Allocation Problem with Multistage Constraints
- A Problem in Optimum Allocation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A graphical method to solve a family of allocation problems
