Abstract
Consider a network $$\mathcal{N}$$ =(G, c, τ) whereG=(N, A) is a directed graph andc ij andτ ij , respectively, denote the capacity and the transmission time of arc (i, j) ∈A. The quickest flow problem is then to determine for a given valueυ the minimum numberT(υ) of time units that are necessary to transmit (send)υ units of flow in $$\mathcal{N}$$ from a given sources to a given sinks′. In this paper we show that the quickest flow problem is closely related to the maximum dynamic flow problem and to linear fractional programming problems. Based on these relationships we develop several polynomial algorithms and a strongly polynomial algorithm for the quickest flow problem. Finally we report computational results on the practical behaviour of our metholds. It turns out that some of them are practically very efficient and well-suited for solving large problem instances.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
