Engineering graph-based models for dynamic timetable information systems (Q1679616): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jda.2017.09.001 / rank
Normal rank
 
Property / author
 
Property / author: Christos D. Zaroliagis / rank
Normal rank
 
Property / author
 
Property / author: Christos D. Zaroliagis / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2760909007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delay-Robustness of Transfer Patterns in Public Transportation Route Planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic multi-level overlay graphs for shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delay Management Problem: Complexity Results and Robust Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recoverable Robustness in Shunting and Timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5240129 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully dynamic update of arc-flags / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering Time-Expanded Graphs for Faster Timetable Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Round-Based Public Transit Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intriguingly Simple and Fast Transit Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Is Timetabling Routing Always Reliable for Public Transportl / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing delay resistant railway timetables / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Dynamic Graph Structure for Large-Scale Transportation Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Timetable Information in the Presence of Delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient models for timetable information in public transportation systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric containers for efficient shortest-path computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trip-Based Public Transit Routing / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JDA.2017.09.001 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:01, 11 December 2024

scientific article
Language Label Description Also known as
English
Engineering graph-based models for dynamic timetable information systems
scientific article

    Statements

    Engineering graph-based models for dynamic timetable information systems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    9 November 2017
    0 references
    journey planning
    0 references
    public transportation systems
    0 references
    timetable models
    0 references
    shortest paths
    0 references
    experimental evaluation
    0 references
    dynamic updates
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references