m-Median and m-Center Problems with Mutual Communication: Solvable Special Cases (Q3990564)

From MaRDI portal
Revision as of 13:57, 23 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
m-Median and m-Center Problems with Mutual Communication: Solvable Special Cases
scientific article

    Statements

    m-Median and m-Center Problems with Mutual Communication: Solvable Special Cases (English)
    0 references
    0 references
    0 references
    28 June 1992
    0 references
    \(m\)-median problem
    0 references
    mutual communication
    0 references
    graph theoretic node selection
    0 references
    polynomial time algorithm
    0 references
    flow graph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references