Point-to-point shortest paths on dynamic time-dependent road networks (Q607878): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10288-010-0121-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2101556618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering Route Planning Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search: Principles and applications / 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

Latest revision as of 13:47, 3 July 2024

scientific article
Language Label Description Also known as
English
Point-to-point shortest paths on dynamic time-dependent road networks
scientific article

    Statements

    Point-to-point shortest paths on dynamic time-dependent road networks (English)
    0 references
    0 references
    0 references
    6 December 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    shortest paths
    0 references
    time-dependent graphs
    0 references
    integer programming
    0 references
    0 references
    0 references
    0 references
    0 references