Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Computing Fastest Paths in Continuous-Time Dynamic Networks with Piecewise Linear Link Travel-Time Functions



    Conference:

    Session, Transportation network modeling ; 2001 ; Washington, DC



    Publication date :

    2001-01-01


    Size :

    8 pages


    Remarks:

    Held as part of the 80th annual meeting of the Transportation Research Board




    Type of media :

    Conference paper


    Type of material :

    Print


    Language :

    English







    Bitwise Algorithm for Fastest Paths in Time-Dependent Networks

    Chabini, I. / Yadappanavar, V. / National Research Council | British Library Conference Proceedings | 2001


    Bitwise Algorithm for Fastest Paths in Time-Dependent Networks

    Chabini, Ismail / Yadappanavar, Vinay | Transportation Research Record | 2001