Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions (Q5749161)

From MaRDI portal
scientific article; zbMATH DE number 4183201
Language Label Description Also known as
English
Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
scientific article; zbMATH DE number 4183201

    Statements

    Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1990
    0 references
    resource allocation
    0 references
    directed acyclic graph
    0 references
    precedence graph
    0 references
    separable convex programming
    0 references
    Lagrangian duality
    0 references
    ellipsoid method
    0 references
    fully- polynomial approximation scheme
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references