A network simplex based algorithm for the minimum cost proportional flow problem with disconnected subnetworks

被引：3

作者：

Bahceci, Ufuk ^{[1
]}

Feyzioglu, Orhan ^{[1
]}

机构：

[1] Galatasaray Univ, Dept Ind Engn, TR-34357 Istanbul, Turkey

来源：

OPTIMIZATION LETTERS | 2012年 / 6卷 / 06期

关键词：

Minimum cost network flow; Proportional flow; Disconnected subnetworks; Network simplex algorithm; MANUFACTURING PROCESS; MODEL;

D O I：

10.1007/s11590-011-0356-5

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

In this study, we present a variant of the minimum cost network flow problem where the associated graph contains several disconnected subgraphs and it is required that the flows on arcs belonging to same arc subsets to be proportional. This type of network is mostly observed in large supply chains of assemble-to-order products. It is shown that any feasible solution of a reformulation of this problem has a special characteristic. By taking into account this fact, a network simplex based primal simplex algorithm is developed and its details are provided.

引用

页码：1173 / 1184

页数：12

共 50 条

[1] A network simplex based algorithm for the minimum cost proportional flow problem with disconnected subnetworks
Ufuk Bahçeci
Orhan Feyziog͂lu
[J]. Optimization Letters, 2012, 6 : 1173 - 1184
[2] Parallel network simplex algorithm for the minimum cost flow problem
Kara, Gokcehan
Ozturan, Can
[J]. CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2022, 34 (04):
[3] An exterior simplex type algorithm for the Minimum Cost Network Flow Problem
Paparrizos, Konstantinos
Samaras, Nikolaos
Sifaleras, Angelo
[J]. COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (04) : 1176 - 1190
[4] Visualization software of the network exterior primal simplex algorithm for the minimum cost network flow problem
D. Andreou
K. Paparrizos
N. Samaras
A. Sifaleras
[J]. Operational Research, 2007, 7 (3) : 449 - 463
[5] A NETWORK SIMPLEX ALGORITHM FOR SOLVING THE MINIMUM DISTRIBUTION COST PROBLEM
Wang, I-Lin
Lin, Shiou-Jie
[J]. JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2009, 5 (04) : 929 - 950
[6] A branch and bound algorithm for minimum cost network flow problem
Han, J
McMahon, G
Sugden, S
[J]. INTELLIGENT DATA ENGINEERING AND AUTOMATED LEARNING - IDEAL 2002, 2002, 2412 : 167 - 172
[7] A new scaling algorithm for the minimum cost network flow problem
Goldfarb, D
Jin, ZY
[J]. OPERATIONS RESEARCH LETTERS, 1999, 25 (05) : 205 - 211
[8] EFFICIENCY OF THE PRIMAL NETWORK SIMPLEX ALGORITHM FOR THE MINIMUM-COST CIRCULATION PROBLEM
TARJAN, RE
[J]. MATHEMATICS OF OPERATIONS RESEARCH, 1991, 16 (02) : 272 - 291
[9] A POLYNOMIAL-TIME DUAL SIMPLEX ALGORITHM FOR THE MINIMUM COST FLOW PROBLEM
NAKAYAMA, A
[J]. JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1987, 30 (03) : 265 - 290
[10] Modified bounded dual network simplex algorithm for solving minimum cost flow problem with fuzzy costs based on ranking functions
Ebrahimnejad, A.
Nasseri, S. H.
Mansourzadeh, S. M.
[J]. JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2013, 24 (01) : 191 - 198

← 1 2 3 4 5 →