Discrete resource allocation with tree constraints by an incremental method
From MaRDI portal
Publication:799478
DOI10.1016/0377-2217(84)90135-8zbMATH Open0548.90051OpenAlexW2035716069MaRDI QIDQ799478FDOQ799478
Authors: K. M. Mjelde 
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
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
optimal solutionupper boundsincremental algorithmactivities with concave return functionsallocation of a linear and discrete resourcetree constraints
Cites Work
- Discrete Optimization Via Marginal Analysis
- Simple Ranking Methods for Allocation of One Resource
- 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
- Title not available (Why is that?)
- A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort
- Discrete Resource Allocation by a Branch and Bound Method
- Resource Allocation with Tree Constraints
- Technical Note—Extension of the Luss-Gupta Resource Allocation Algorithm by Means of First Order Approximation Techniques
- Title not available (Why is that?)
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)
