m-Median and m-Center Problems with Mutual Communication: Solvable Special Cases (Q3990564): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:15, 30 January 2024
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
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
