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 条

[31] Ameliorative Minimum Cost Flow Algorithm for Phase Unwrapping
Jiang Ting-chen
2011 3RD INTERNATIONAL CONFERENCE ON ENVIRONMENTAL SCIENCE AND INFORMATION APPLICATION TECHNOLOGY ESIAT 2011, VOL 10, PT C, 2011, 10 : 2560 - 2566
[32] A cost-scaling algorithm for minimum-cost node-capacitated multiflow problem
Hirai, Hiroshi
Ikeda, Motoki
MATHEMATICAL PROGRAMMING, 2022, 195 (1-2) : 149 - 181
[33] A cost-scaling algorithm for minimum-cost node-capacitated multiflow problem
Hiroshi Hirai
Motoki Ikeda
Mathematical Programming, 2022, 195 : 149 - 181
[34] Approximation algorithm for minimum cost flow allocation with varied survivability
Lahoud, Samer
Texier, Geraldine
Toutain, Laurent
2006 2ND CONFERENCE ON NEXT GENERATION INTERNET DESIGN AND ENGINEERING, 2006, : 292 - +
[35] Generic auction algorithm for the minimum cost network flow problem
Bertsekas, Dimitri P.
Castanon, David A.
Computational Optimization and Applications, 1993, 2 (03) : 229 - 260
[36] Unwrapping large interferograms using the minimum cost flow algorithm
Eineder, M
Hubig, M
Milcke, B
IGARSS '98 - 1998 INTERNATIONAL GEOSCIENCE AND REMOTE SENSING SYMPOSIUM, PROCEEDINGS VOLS 1-5: SENSING AND MANAGING THE ENVIRONMENT, 1998, : 83 - 87
[37] INFEASIBILITY PRICING ALGORITHM FOR MULTICOMMODITY MINIMUM COST FLOW PROBLEM
BAZARAA, MS
COMPUTERS & OPERATIONS RESEARCH, 1978, 5 (04) : 251 - 261
[38] A STRONGLY POLYNOMIAL ALGORITHM FOR MINIMUM COST SUBMODULAR FLOW PROBLEMS
FUJISHIGE, S
ROCK, H
ZIMMERMANN, U
MATHEMATICS OF OPERATIONS RESEARCH, 1989, 14 (01) : 60 - 69
[39] A fast minimum cost flow algorithm for VLSI layout compaction
Arungsrisangchai, I
Shigehiro, Y
Shirakawa, I
Takahashi, H
ISCAS '97 - PROCEEDINGS OF 1997 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS I - IV: CIRCUITS AND SYSTEMS IN THE INFORMATION AGE, 1997, : 1672 - 1675
[40] AN O(NLOGN)-ALGORITHM FOR THE MINIMUM COST FLOW PROBLEM IN TREES
BRUCKER, P
LECTURE NOTES IN ECONOMICS AND MATHEMATICAL SYSTEMS, 1984, 226 : 299 - 306

← 1 2 3 4 5 →