Maximum flow problem in the distribution network

R.L. Sheu; M.J. Ting; I.L. Wang

doi:10.3934/jimo.2006.2.237

Article Contents

2006, Volume 2, Issue 3: 237-254. Doi: 10.3934/jimo.2006.2.237

This issue Previous Article Next Article Quick response in fashion supply chains with dual information updating

Maximum flow problem in the distribution network

1.
Department of Mathematics, National Cheng-Kung University, Tainan
2.
Product Development Department, Shinkong Life Insurance Co., LTD., Taipei
3.
Department of Industrial and Information Management, National Cheng-Kung University, Tainan

Received: August 31, 2005

Revised: November 30, 2005

Published: June 2006

Abstract Related Papers Cited by

Abstract

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.

Keywords:

Mathematics Subject Classification: 90B10, 49M35.

Citation:

Article Metrics

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

Maximum flow problem in the distribution network

Abstract

Access History

Article Metrics

Access History

Other Articles By Authors

Catalog

Maximum flow problem in the distribution network

Abstract

Access History

SHARE

Article Metrics

Access History

Other Articles By Authors

Catalog

Export File

Citation

Format

Content