An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint (Q6161898)

From MaRDI portal
Revision as of 12:29, 1 August 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7703344
Language Label Description Also known as
English
An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint
scientific article; zbMATH DE number 7703344

    Statements

    An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint (English)
    0 references
    0 references
    28 June 2023
    0 references
    matroid intersection
    0 references
    generalized polymatroid
    0 references
    nonseparable discrete convex function
    0 references
    polynomial algorithm
    0 references

    Identifiers