Minmax regret location--allocation problem on a network under uncertainty (Q864020)
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 location--allocation problem on a network under uncertainty |
scientific article; zbMATH DE number 5124546
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minmax regret location--allocation problem on a network under uncertainty |
scientific article; zbMATH DE number 5124546 |
Statements
Minmax regret location--allocation problem on a network under uncertainty (English)
0 references
12 February 2007
0 references
location problems
0 references
polynomial algorithms
0 references
complexity
0 references
robust optimization
0 references
0 references
0 references
0.9583416
0 references
0 references
0.9457598
0 references
0.9457598
0 references
0.91269433
0 references
0.9068329
0 references
0.90581614
0 references
0.9051162
0 references
0.9036394
0 references
