Dynamic shortest path problems: hybrid routing policies considering network disruptions (Q336651)
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: Dynamic shortest path problems: hybrid routing policies considering network disruptions |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dynamic shortest path problems: hybrid routing policies considering network disruptions |
scientific article |
Statements
Dynamic shortest path problems: hybrid routing policies considering network disruptions (English)
0 references
10 November 2016
0 references
dynamic shortest path problem
0 references
dynamic programming
0 references
disruption handling
0 references
transportation
0 references
online routing
0 references
offline routing
0 references
