Discrete resource allocation with tree constraints by an incremental method (Q799478): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Technical Note—Extension of the Luss-Gupta Resource Allocation Algorithm by Means of First Order Approximation Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Optimization Via Marginal Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Allocation of Effort Resources among Competing Activities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146566 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Resource Allocation by a Branch and Bound Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4750414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource Allocation with Tree Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Bound Procedure for a Class of Discrete Resource Allocation Problems with Several Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Ranking Methods for Allocation of One Resource / rank
 
Normal rank

Latest revision as of 15:47, 14 June 2024

scientific article
Language Label Description Also known as
English
Discrete resource allocation with tree constraints by an incremental method
scientific article

    Statements

    Discrete resource allocation with tree constraints by an incremental method (English)
    0 references
    0 references
    1984
    0 references
    0 references
    tree constraints
    0 references
    allocation of a linear and discrete resource
    0 references
    activities with concave return functions
    0 references
    upper bounds
    0 references
    optimal solution
    0 references
    incremental algorithm
    0 references
    0 references