NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times (Q2094362): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An Appraisal of Some Shortest-Path Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-dependent routing problems: a review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-Dependent Route Planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidirectional A* search on time-dependent road networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-efficient, fast and exact routing in time-dependent road networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum weight paths in time-dependent networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of time-dependent shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On strong NP-completeness of rational problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: An ongoing guide / rank
 
Normal rank

Latest revision as of 16:39, 30 July 2024

scientific article
Language Label Description Also known as
English
NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times
scientific article

    Statements

    Identifiers