Some further results on minimum distribution cost flow problems

Haiyan Lu, Enyu Yao, Liqun Qi

Research output: Journal article publicationJournal articleAcademic researchpeer-review

8 Citations (Scopus)

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.
Original languageEnglish
Pages (from-to)351-371
Number of pages21
JournalJournal of Combinatorial Optimization
Volume11
Issue number4
DOIs
Publication statusPublished - 1 Jun 2006

Keywords

  • Manufacturing network flow
  • Minimum cost network flow
  • Network simplex algorithm
  • Networks with side constraints

ASJC Scopus subject areas

  • Computer Science Applications
  • Discrete Mathematics and Combinatorics
  • Control and Optimization
  • Computational Theory and Mathematics
  • Applied Mathematics

Cite this