Cost-effective allocations of bounded and binary resources in polynomial time (Q1168898): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Fractional Programming with Homogeneous Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming with linear fractional functionals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3318566 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4197641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Fulkerson's Conjecture About Consistent Labeling Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location of a discrete resource and its allocation according to a fractional objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Allocations of Discrete and Binary Resources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameter-free convex equivalent and dual programs of fractional programming problems / rank
 
Normal rank

Latest revision as of 15:47, 13 June 2024

scientific article
Language Label Description Also known as
English
Cost-effective allocations of bounded and binary resources in polynomial time
scientific article

    Statements

    Cost-effective allocations of bounded and binary resources in polynomial time (English)
    0 references
    0 references
    1982
    0 references
    resource allocation
    0 references
    ratio optimization
    0 references
    polynomial algorithm
    0 references
    linear resources
    0 references
    discrete resources
    0 references
    concave activities
    0 references
    binary effectiveness values
    0 references
    algorithms
    0 references
    upper bound
    0 references

    Identifiers