A polynomial algorithm for the two-connections variant of the tree \(p\)-median problem (Q2339828): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Solution methods for thep-median problem: An annotated bibliography / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Algorithmic Approach to Network Location Problems. II: The<i>p</i>-Medians / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs / rank | |||
Normal rank | |||
Latest revision as of 23:16, 9 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial algorithm for the two-connections variant of the tree \(p\)-median problem |
scientific article |
Statements
A polynomial algorithm for the two-connections variant of the tree \(p\)-median problem (English)
0 references
9 April 2015
0 references
location
0 references
dynamic programming
0 references
\(p\)-median problem
0 references
