NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times (Q2094362)
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: NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times |
scientific article; zbMATH DE number 7609039
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times |
scientific article; zbMATH DE number 7609039 |
Statements
NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times (English)
0 references
28 October 2022
0 references
non-FIFO time-dependent shortest paths
0 references
NP-hardness
0 references
theory of computation
0 references
