A graphical method to solve a family of allocation problems-Reference-Cited by-同舟云学术

A graphical method to solve a family of allocation problems

Published:1984-07 Issue:1 Volume:17 Page:31-34
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Vidal RenéVictor Valqui

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference12 articles.

1. On the solution of convex knapsack problems with bounded variables;Bitran,1976

2. On reducing a resource allocation problem to a single one-dimensional minimization of a differentiable convex function;Horst;Operational Res.,1981

3. A Distribution Model Applicable to Economics;Jensen,1954

4. Some production planning problems;Klein;Naval Res. Logist. Quart.,1957

5. Allocation of effort resources among competing activities;Luss;Operations Res.,1975

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives;INFORMS Journal on Computing;2021-07

2. A survey on the continuous nonlinear resource allocation problem;European Journal of Operational Research;2008-02

3. On Equitable Resource Allocation Problems: A Lexicographic Minimax Approach;Operations Research;1999-06

4. Minimax resource allocation problems with ordering constraints;Naval Research Logistics;1994-10

5. Minmax linear knapsack problem with grouped variables and gub;Optimization;1993-01