Minimax regret sink location problem in dynamic tree networks with uniform capacity (Q2938749)
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 6386935
| 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 6386935 |
Statements
Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity (English)
0 references
15 January 2015
0 references
scenario
0 references
0.9983030557632446
0 references
0.9209797382354736
0 references
0.9205196499824524
0 references
0.8836081624031067
0 references
0.8807474374771118
0 references
