Minsum \(k\)-sink problem on path networks (Q2285143)
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 7152266
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minsum \(k\)-sink problem on path networks |
scientific article; zbMATH DE number 7152266 |
Statements
Minsum \(k\)-sink problem on path networks (English)
0 references
16 January 2020
0 references
facility location
0 references
sink location problem
0 references
evacuation problem
0 references
minsum criterion
0 references
dynamic flow in network
0 references
0 references
0 references
0 references
0.9213106632232666
0 references
0.893343448638916
0 references
0.8926661610603333
0 references
0.8848205208778381
0 references
0.8822889924049377
0 references
