An improved algorithm for the minmax regret path centdian problem on trees (Q1672003)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An improved algorithm for the minmax regret path centdian problem on trees |
scientific article; zbMATH DE number 6934100
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved algorithm for the minmax regret path centdian problem on trees |
scientific article; zbMATH DE number 6934100 |
Statements
An improved algorithm for the minmax regret path centdian problem on trees (English)
0 references
7 September 2018
0 references
location theory
0 references
minmax regret optimization
0 references
medians
0 references
centers
0 references
centdians
0 references
trees
0 references
0 references
0 references
