Cheapest paths in dynamic networks (Q4565769): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:40, 7 February 2024
scientific article; zbMATH DE number 6887368
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
