An improved algorithm for the minmax regret path center problem on trees (Q2194857): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JCSS.2020.05.002 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JCSS.2020.05.002 / rank | |||
Normal rank | |||
Latest revision as of 10:37, 17 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved algorithm for the minmax regret path center problem on trees |
scientific article |
Statements
An improved algorithm for the minmax regret path center problem on trees (English)
0 references
7 September 2020
0 references
location theory
0 references
minmax regret optimization
0 references
centers
0 references
path centers
0 references
trees
0 references
0 references
0 references
