EUVIMEDEUVIMED entdecken
Crossref

Efficient Algorithms for Identifying Loop Formation and Computing θ Value for Solving Minimum Cost Flow Network Problems

TIMOTHY MICHAEL CHÁVEZ, DUC THAI NGUYEN

WSEAS TRANSACTIONS ON CIRCUITS AND SYSTEMS · 2021

DOI: 10.37394/23201.2021.20.14 ↗

Kurz gefasst

Fachartikel in der Zeitschrift WSEAS TRANSACTIONS ON CIRCUITS AND SYSTEMS, 2021. Verfasst von TIMOTHY MICHAEL CHÁVEZ und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 17 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Zitieren

APA

CHÁVEZ, T. M., & NGUYEN, D. T. (2021). Efficient Algorithms for Identifying Loop Formation and Computing θ Value for Solving Minimum Cost Flow Network Problems. WSEAS TRANSACTIONS ON CIRCUITS AND SYSTEMS. https://doi.org/10.37394/23201.2021.20.14

Vancouver

CHÁVEZ TM, NGUYEN DT. Efficient Algorithms for Identifying Loop Formation and Computing θ Value for Solving Minimum Cost Flow Network Problems. WSEAS TRANSACTIONS ON CIRCUITS AND SYSTEMS. 2021. doi:10.37394/23201.2021.20.14

BibTeX
@article{CHVEZ2021,
  author = {CHÁVEZ, TIMOTHY MICHAEL and NGUYEN, DUC THAI},
  title = {Efficient Algorithms for Identifying Loop Formation and Computing θ Value for Solving Minimum Cost Flow Network Problems},
  journal = {WSEAS TRANSACTIONS ON CIRCUITS AND SYSTEMS},
  year = {2021},
  doi = {10.37394/23201.2021.20.14}
}
Kostenlos starten →