Advanced Search
Article Contents
Article Contents

Maximum flow problem in the distribution network

Abstract Related Papers Cited by
  • In this paper, we are concerned with the maximum flow problem in the distribution network, a new kind of network recently introduced by Fang and Qi. It differs from the traditional network by the presence of the $D$-node through which the commodities are to be distributed proportionally. Adding $ D $-nodes complicates the network structure. Particularly, flows in the distribution network are frequently increased through multiple cycles. To this end, we develop a type of depth-first-search algorithm which counts and finds all unsaturated subgraphs. The unsaturated subgraphs, however, could be invalid either topologically or numerically. The validity are then judged by computing the flow increment with a method we call the multi-labeling method. Finally, we also provide a phase-one procedure for finding an initial flow.
    Mathematics Subject Classification: 90B10, 49M35.


    \begin{equation} \\ \end{equation}
  • 加载中

Article Metrics

HTML views() PDF downloads(145) Cited by(0)

Access History

Other Articles By Authors



    DownLoad:  Full-Size Img  PowerPoint