A greedy algorithm for solving a class of convex programming problems and its connection with polymatroid theory (Q3682254)

From MaRDI portal
Revision as of 18:00, 14 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
A greedy algorithm for solving a class of convex programming problems and its connection with polymatroid theory
scientific article

    Statements

    A greedy algorithm for solving a class of convex programming problems and its connection with polymatroid theory (English)
    0 references
    1985
    0 references
    greedy algorithm
    0 references
    polymatroid theory
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references