Minimum cost paths over dynamic networks (Q325482): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90B10 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C35 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6640292 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
flows over time | |||
| Property / zbMATH Keywords: flows over time / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
dynamic networks | |||
| Property / zbMATH Keywords: dynamic networks / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
computational complexity | |||
| Property / zbMATH Keywords: computational complexity / rank | |||
Normal rank | |||
Revision as of 02:51, 28 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum cost paths over dynamic networks |
scientific article |
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
