Minimum cost paths over dynamic networks (Q325482)
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 6640292
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum cost paths over dynamic networks |
scientific article; zbMATH DE number 6640292 |
Statements
Minimum cost paths over dynamic networks (English)
0 references
18 October 2016
0 references
flows over time
0 references
dynamic networks
0 references
computational complexity
0 references
0.9594823122024536
0 references
0.871256947517395
0 references
0.8626935482025146
0 references
0.8569200038909912
0 references
