A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices (Q3725872)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices
scientific article

    Statements

    A Dynamic Programming Algorithm for Covering Problems with (Greedy) Totally Balanced Constraint Matrices (English)
    0 references
    0 references
    0 references
    1986
    0 references
    Minimum Cost Maximal Covering Problem
    0 references
    Totally balanced matrices
    0 references
    tree network location
    0 references

    Identifiers

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