Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity (Q5746252)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6258740
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity |
scientific article; zbMATH DE number 6258740 |
Statements
Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity (English)
0 references
18 February 2014
0 references
minimax regret
0 references
sink location
0 references
dynamic flow
0 references
evacuation planning
0 references
0.9999999
0 references
0.9472085
0 references
0.93401444
0 references
0.9337213
0 references
0.9291971
0 references
0.92674613
0 references
0.9235518
0 references
0.92073995
0 references
0.91048086
0 references
