American Journal of Mathematical and Computer Modelling

Volume 9, Issue 2, June 2024

  • Review Article

    The Maximum Attainable Flow and Minimal Cost Problem in a Network

    Amanuel Belachew Beyi, Temesgen Alemu Godana*

    Issue: Volume 9, Issue 2, June 2024
    Pages: 22-37
    Received: 31 March 2024
    Accepted: 6 May 2024
    Published: 17 May 2024
    DOI: 10.11648/j.ajmcm.20240902.11
    Abstract: This paper, presents an efficient algorithm that solves such a large class of optimization problems. Ford-Fulkerson determines the maximum flow in a network by iteratively augmenting flow paths until no further improvement is possible. On the other hand, Dijkstra's algorithm excels in finding the shortest path in a weighted graph, making it suitabl... Show More