Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A O(nm) Heuristic to the Hierarchical Maximum Concurrent Flow Problem


    Contributors:

    Conference:

    AIAA Information Systems-AIAA Infotech @ Aerospace



    Publication date :

    2017-01-01




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    A O(nm) Heuristic to the Hierarchical Maximum Concurrent Flow Problem (AIAA 2017-0880)

    Vilas, Fernando E. / Olinick, Eli / Matula, David | British Library Conference Proceedings | 2017


    Graph Coarsening for Runtime Improvements in the Maximum Concurrent Flow Problem

    Vilas, Fernando E. / Olinick, Eli / Matula, David | AIAA | 2018


    Graph Coarsening for Runtime Improvements in the Maximum Concurrent Flow Problem (AIAA 2018-0468)

    Vilas, Fernando E. / Olinick, Eli / Matula, David | British Library Conference Proceedings | 2018


    Ring hierarchical hub network design problem: Exact and heuristic solution methods

    Alireza Eydi / Amir Khaleghi / Khaled Barzegar | DOAJ | 2022

    Free access