A scaling out-of-kilter algorithm for minimum cost flow

被引：0

作者：

Ciupala, L ^{[1
]}

机构：

[1] Transilvania Univ Brasov, Fac Math & Informat, Iuliu Maniu 50, Romania

来源：

CONTROL AND CYBERNETICS | 2005年 / 34卷 / 04期

关键词：

network flow; minimum cost flow; shortest path; scaling technique;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

The out-of-kilter algorithm is one of the basic algorithms that solve the minimum cost flow problem. Its drawback is that it can improve the objective function at each iteration by only a small value. Consequently, it runs in pseudo-polynomial time. In this paper, we describe a new out-of-kilter algorithm for minimum cost flow that runs in polynomial time. Our algorithm is a scaling algorithm and improves the objective function at each time by a "sufficiently large" value.

引用

页码：1169 / 1174

页数：6

共 50 条

[41] A branch and bound algorithm for minimum cost network flow problem
Han, J
McMahon, G
Sugden, S
INTELLIGENT DATA ENGINEERING AND AUTOMATED LEARNING - IDEAL 2002, 2002, 2412 : 167 - 172
[42] Parallel network simplex algorithm for the minimum cost flow problem
Kara, Gokcehan
Ozturan, Can
CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2022, 34 (04):
[43] L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem
Hirai, Hiroshi
DISCRETE OPTIMIZATION, 2015, 18 : 1 - 37
[44] A deterministic annealing algorithm for the minimum concave cost network flow problem
Dang, Chuangyin
Sun, Yabin
Wang, Yuping
Yang, Yang
NEURAL NETWORKS, 2011, 24 (07) : 699 - 708
[45] A least-squares minimum-cost network flow algorithm
Gopalakrishnan, Balaji
Kong, Seunghyun
Barnes, Earl
Johnson, Ellis L.
Sokol, Joel S.
ANNALS OF OPERATIONS RESEARCH, 2011, 186 (01) : 119 - 140
[46] An implementation of a combinatorial approximation algorithm for minimum-cost multicommodity flow
Goldberg, AV
Oldham, JD
Plotkin, S
Stein, C
INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 1998, 1412 : 338 - 352
[47] A least-squares minimum-cost network flow algorithm
Balaji Gopalakrishnan
Seunghyun Kong
Earl Barnes
Ellis L. Johnson
Joel S. Sokol
Annals of Operations Research, 2011, 186 : 119 - 140
[48] A strongly polynomial cut canceling algorithm for minimum cost submodular flow
Iwata, S
McCormick, ST
Shigeno, M
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2005, 19 (02) : 304 - 320
[49] OPEN FLOW-BASED MEDICAL NETWORK MINIMUM COST ALGORITHM
Cui, Xin
Huang, Xiaohong
Ma, Yan
Zhang, Pei
JOURNAL OF INVESTIGATIVE MEDICINE, 2016, 64 (08) : A21 - A21
[50] Solution of task on the minimum cost data flow based on bionic algorithm
Poluyan, A. Yu
Purchina, O. A.
Fugarov, D. D.
Golovanov, A. A.
Smirnova, O. V.
INTERNATIONAL CONFERENCE: INFORMATION TECHNOLOGIES IN BUSINESS AND INDUSTRY, 2019, 1333

← 1 2 3 4 5 →