Papers by Madan Bahadur Chand
Journal of advance college of engineering and management, Aug 25, 2022
Discrete and continuous time dynamic flow problems have been studied for decades. The purpose of ... more 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.
International Journal of Statistics and Applied Mathematics
Path problems were basically studied to find an alternate path that is, finding a second shortest... more Path problems were basically studied to find an alternate path that is, finding a second shortest route, if the route is blocked. The shortest path problem is mainly focused on finding the shortest paths between the vertices of a given network. A new variant of shortest path problem is quickest path problem, where the predetermined data is sent from the source to the sink. The quickest flow problem relaxes the limitations of single path to multiple paths. In this paper we reviewed the shortest path problem, quickest path problem and quickest flow problem. Later on, each problem is clarified with certain examples.
Path problems were basically studied to find an alternate path that is, finding a second shortest... more Path problems were basically studied to find an alternate path that is, finding a second shortest route, if the route is blocked. The shortest path problem is mainly focused on finding the shortest paths between the vertices of a given network. A new variant of shortest path problem is quickest path problem, where the predetermined data is sent from the source to the sink. The quickest flow problem relaxes the limitations of single path to multiple paths. In this paper we reviewed the shortest path problem, quickest path problem and quickest flow problem. Later on, each problem is clarified with certain examples.
advances engineering college journal, 2022
Discrete and continuous time dynamic flow problems have been studied for decades. The purpose of ... more 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.
Journal of Advanced College of Engineering and Management
Discrete and continuous time dynamic flow problems have been studied for decades. The purpose of ... more 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.
Uploads
Papers by Madan Bahadur Chand