A Study on the Multichannel Quickest Path Problem for Continuous Flow
连续型多通道最速路问题研究

This paper deals with the multichannel quickest path (MoP) problem between two given nodes in a network N = (V,A,c,1). Mathematical models of MQP problems are presented. Necessary and sufficient conditions of the optimal strategy for solving the models are discussed, and a formulated solution is derived. Based upon the result, a recursive algorithm for the MQP problem in a dynamic network is developed and its usage is shown by an example.