Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Finding Edge-disjoint Paths in Networks: An Ant Colony Optimization Algorithm


    Contributors:
    Blesa, M. J. (author) / Blum, C. (author)


    Publication date :

    2007-01-01


    Size :

    31 pages



    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English


    Classification :

    DDC:    003.3






    Finding Reliable Shortest Paths in Dynamic Stochastic Networks

    Wu, Xing | Transportation Research Record | 2013


    Finding the best multimodal paths in urban transportation networks

    Di Febbraro, A. / Sacone, S. / International Federation of Automatic Control | British Library Conference Proceedings | 1997