Discrete resource allocation with tree constraints by an incremental method
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3845343
- Discrete allocation of a linear resource according to a sum-of-products objective
- Methods and algorithms for solving the resource allocation problem
- Minimax Resource Allocation with Tree Structured Substitutable Resources
- scientific article; zbMATH DE number 1302182
Cites work
- scientific article; zbMATH DE number 3577025 (Why is no real title available?)
- scientific article; zbMATH DE number 3807359 (Why is no real title available?)
- A Branch and Bound Procedure for a Class of Discrete Resource Allocation Problems with Several Constraints
- A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort
- Discrete Optimization Via Marginal Analysis
- Discrete Resource Allocation by a Branch and Bound Method
- Resource Allocation with Tree Constraints
- Simple Ranking Methods for Allocation of One Resource
- Technical Note—Allocation of Effort Resources among Competing Activities
- Technical Note—Extension of the Luss-Gupta Resource Allocation Algorithm by Means of First Order Approximation Techniques
Cited in
(4)
This page was built for publication: Discrete resource allocation with tree constraints by an incremental method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q799478)