Bidirectional A* search on time-dependent road networks (Q2892160): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/net.20438 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2140836772 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Routing in Road Networks with Transit Nodes / rank
 
Normal rank
Property / cites work
 
Property / cites work: SHARC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speeding Up Dynamic Shortest-Path Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shortest route through a network with time-dependent internodal transit times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-dependent SHARC-routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering Route Planning Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-Dependent Route Planning / 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: An Appraisal of Some Shortest-Path Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths with euclidean distances: An explanatory model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast paths in large-scale dynamic road networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths on dynamic graphs / 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: Shortest paths in Euclidean graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric containers for efficient shortest-path computation / rank
 
Normal rank

Revision as of 08:18, 5 July 2024

scientific article
Language Label Description Also known as
English
Bidirectional A* search on time-dependent road networks
scientific article

    Statements

    Bidirectional A* search on time-dependent road networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    18 June 2012
    0 references
    shortest paths
    0 references
    time-dependent networks
    0 references
    road networks
    0 references
    goal directed search
    0 references

    Identifiers