A Brief Review on Maximum Flows in Networks with Continuous-Time Settings

Authors

  • Madan Bahadur Chand Gokuleshwor Multiple Campus, Far-western University, Mahendranagar, Kanchanpur, Nepal
  • Tanka Nath Dhamala Central Department of Mathematics, IOST, Tribhuvan University, Kathmandu, Nepal

DOI:

https://doi.org/10.3126/jacem.v7i01.47335

Keywords:

Cut, generalized cut, flows, reachable node,, continuous time dynamic flow

Abstract

Discrete and continuous time dynamic flow problems have been studied for decades. The purpose of the network flow problem is to find the maximum flow that can be sent from the source node to the destination node. Our aim is to review the general class of continuous time dynamic flow problems. We discuss about static cut and generalized dynamic cut, the latter one used to prove the maximum flow minimum cut theorem in continuous case.

Downloads

Download data is not yet available.
Abstract
123
PDF
116

Downloads

Published

2022-08-25

How to Cite

Chand, M. B., & Dhamala, T. N. (2022). A Brief Review on Maximum Flows in Networks with Continuous-Time Settings. Journal of Advanced College of Engineering and Management, 7(01), 81–91. https://doi.org/10.3126/jacem.v7i01.47335

Issue

Vol. 7 No. 01 (2022)

Section

Articles

License

JACEM reserves the copyright for the published papers. Author will have right to use content of the published paper in part or in full for their own work.