Cheapest paths in dynamic networks (Q4565769): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.21714 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2539829685 / rank | |||
Normal rank | |||
Latest revision as of 21:39, 19 March 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
