An \(O(n^2\log^2 n)\) time algorithm for minmax regret minsum sink on path networks (Q5091004)
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 7561368
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O(n^2\log^2 n)\) time algorithm for minmax regret minsum sink on path networks |
scientific article; zbMATH DE number 7561368 |
Statements
21 July 2022
0 references
facility location
0 references
minsum sink
0 references
evacuation problem
0 references
minmax regret
0 references
dynamic flow path network
0 references
0 references
0.9077056646347046
0 references
0.902899444103241
0 references
0.8817371129989624
0 references
0.8785735964775085
0 references
0.8671146035194397
0 references
