m-Median and m-Center Problems with Mutual Communication: Solvable Special Cases (Q3990564): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1287/opre.40.1.S56 / rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1287/OPRE.40.1.S56 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 21:32, 28 December 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