Cheapest paths in dynamic networks (Q4565769)
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: Cheapest paths in dynamic networks |
scientific article; zbMATH DE number 6887368
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cheapest paths in dynamic networks |
scientific article; zbMATH DE number 6887368 |
Statements
Cheapest paths in dynamic networks (English)
0 references
13 June 2018
0 references
network flows
0 references
shortest path
0 references
time-dependent networks
0 references
time-expanded networks
0 references
branch and bound
0 references
computational complexity
0 references
0.95167565
0 references
0.90867907
0 references
0 references
0 references
0.8926649
0 references
0 references
