Complexity of robust single facility location problems on networks with uncertain edge lengths. (Q1811071)
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: Complexity of robust single facility location problems on networks with uncertain edge lengths. |
scientific article; zbMATH DE number 1925254
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of robust single facility location problems on networks with uncertain edge lengths. |
scientific article; zbMATH DE number 1925254 |
Statements
Complexity of robust single facility location problems on networks with uncertain edge lengths. (English)
0 references
10 June 2003
0 references
Minmax regret optimization
0 references
Location
0 references
NP-completeness
0 references
0 references
0.8078615069389343
0 references
0.7891644239425659
0 references
0.7844178080558777
0 references
0.7841126322746277
0 references
0.7829048037528992
0 references
