Discrete resource allocation with tree constraints by an incremental method
From MaRDI portal
Publication:799478
DOI10.1016/0377-2217(84)90135-8zbMath0548.90051MaRDI QIDQ799478
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)90135-8
upper bounds; optimal solution; incremental algorithm; activities with concave return functions; allocation of a linear and discrete resource; tree constraints
90C10: Integer programming
Cites Work
- Unnamed Item
- Unnamed Item
- Resource Allocation with Tree Constraints
- Simple Ranking Methods for Allocation of One Resource
- Technical Note—Extension of the Luss-Gupta Resource Allocation Algorithm by Means of First Order Approximation Techniques
- Technical Note—Allocation of Effort Resources among Competing Activities
- A Branch and Bound Procedure for a Class of Discrete Resource Allocation Problems with Several Constraints
- Discrete Resource Allocation by a Branch and Bound Method
- A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort
- Discrete Optimization Via Marginal Analysis