Minimax regret vertex 2-sink location problem in dynamic path networks (Q5963611)
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: Minimax regret vertex 2-sink location problem in dynamic path networks |
scientific article; zbMATH DE number 6544299
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimax regret vertex 2-sink location problem in dynamic path networks |
scientific article; zbMATH DE number 6544299 |
Statements
Minimax regret vertex 2-sink location problem in dynamic path networks (English)
0 references
23 February 2016
0 references
minimax regret
0 references
sink location
0 references
path network
0 references
algorithm
0 references
0 references
0.9466188549995422
0 references
0.943735420703888
0 references
0.9118368625640868
0 references
0.91097229719162
0 references
0.909344494342804
0 references
