Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks (Q496433)
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: Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks |
scientific article; zbMATH DE number 6483956
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks |
scientific article; zbMATH DE number 6483956 |
Statements
Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks (English)
0 references
21 September 2015
0 references
facility location
0 references
1-center problem
0 references
minmax regret optimization
0 references
robust solution
0 references
uncertain weight
0 references
0 references
0.94147825
0 references
0 references
0.90669847
0 references
0.9051413
0 references
0.8997768
0 references
0.89882857
0 references
0.8927238
0 references
0.8927238
0 references
0.8877227
0 references
