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.
確定! 回上一頁