Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/22280
Title: Some further results on minimum distribution cost flow problems
Authors: Lu, H
Yao, E
Qi, L 
Keywords: Manufacturing network flow
Minimum cost network flow
Network simplex algorithm
Networks with side constraints
Issue Date: 2006
Source: Journal of combinatorial optimization, 2006, v. 11, no. 4, p. 351-371 How to cite?
Journal: Journal of Combinatorial Optimization 
Abstract: Manufacturing network flow (MNF) is a generalized network model that can model more complicated manufacturing scenarios, such as the synthesis of different materials to one product and/or the distilling of one material to many different products. Minimum distribution cost flow problem (MDCF) is a simplified version of MNF optimization problems, in which a general supplier wants to proportionally distribute certain amount of a particular product from a source node to several retailers at different destinations through a distribution network. A network simplex algorithm has been outlined in recent years for solving a special case of MDCF. In this paper, we characterize the network structure of the bases of the MDCF problem and develop a primal simplex algorithm that exploits the network structure of the problem. These results are extensions of those of the ordinary network flow problems. In conclusion, some related interesting problems are proposed for future research.
URI: http://hdl.handle.net/10397/22280
ISSN: 1382-6905
DOI: 10.1007/s10878-006-8211-9
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

6
Last Week
0
Last month
1
Citations as of Sep 22, 2017

WEB OF SCIENCETM
Citations

6
Last Week
0
Last month
0
Citations as of Sep 20, 2017

Page view(s)

36
Last Week
5
Last month
Checked on Sep 25, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.