A review on the quickest flow problem

Abstract

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.