Document Type
Article
Publication Date
2021
DOI
10.37394/23201.2021.20.14
Publication Title
WSEAS Transactions on Circuits and Systems
Volume
20
Pages
107-117
Abstract
While the minimum cost flow (MCF) problems have been well documented in many publications, due to its broad applications, little or no effort have been devoted to explaining the algorithms for identifying loop formation and computing the value needed to solve MCF network problems. This paper proposes efficient algorithms, and MATLAB computer implementation, for solving MCF problems. Several academic and real-life network problems have been solved to validate the proposed algorithms; the numerical results obtained by the developed MCF code have been compared and matched with the built-in MATLAB function Linprog() (Simplex algorithm) for further validation.
Original Publication Citation
Chavez, T. M., & Duc Thai, N. (2021). Efficient algorithms for identifying loop formation and computing value for solving minimum cost flow network problems. WSEAS Transactions on Circuits and Systems, 20, 107-117. https://doi.org/10.37394/23201.2021.20.14
Repository Citation
Chávez, Timothy Michael and Nguyen, Duc Thai, "Efficient Algorithms for Identifying Loop Formation and Computing θ Value for Solving Minimum Cost Flow Network Problems" (2021). Computational Modeling & Simulation Engineering Faculty Publications. 69.
https://digitalcommons.odu.edu/msve_fac_pubs/69
Included in
Operations and Supply Chain Management Commons, OS and Networks Commons, Theory and Algorithms Commons
Comments
This article is published under the terms of the Creative Commons Attribution 4.0 International (CC BY 4.0) License 4.0.