A STRONGLY POLYNOMIAL ALGORITHM FOR MINIMUM COST SUBMODULAR FLOW PROBLEMS

被引：17

作者：

FUJISHIGE, S

ROCK, H

ZIMMERMANN, U

机构：

[1] TECH UNIV BERLIN,D-1000 BERLIN 12,FED REP GER

[2] TECH UNIV BRUNSWICK,INST ANGEW MATH,D-3300 BRUNSWICK,FED REP GER

来源：

MATHEMATICS OF OPERATIONS RESEARCH | 1989年 / 14卷 / 01期

关键词：

D O I：

10.1287/moor.14.1.60

中图分类号：

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

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：60 / 69

页数：10

共 50 条

[1] A strongly polynomial cut canceling algorithm for minimum cost submodular flow
Iwata, S
McCormick, ST
Shigeno, M
[J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2005, 19 (02) : 304 - 320
[2] A FASTER STRONGLY POLYNOMIAL MINIMUM COST FLOW ALGORITHM
ORLIN, JB
[J]. OPERATIONS RESEARCH, 1993, 41 (02) : 338 - 350
[3] A POLYNOMIAL ALGORITHM FOR MINIMUM QUADRATIC COST FLOW PROBLEMS
MINOUX, M
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1984, 18 (03) : 377 - 387
[4] Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives
Vegh, Laszlo A.
[J]. STOC'12: PROCEEDINGS OF THE 2012 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2012, : 27 - 39
[5] A STRONGLY POLYNOMIAL ALGORITHM FOR A CLASS OF MINIMUM-COST FLOW PROBLEMS WITH SEPARABLE CONVEX OBJECTIVES
Vegh, Laszlo A.
[J]. SIAM JOURNAL ON COMPUTING, 2016, 45 (05) : 1729 - 1761
[6] A STRONGLY POLYNOMIAL MINIMUM COST CIRCULATION ALGORITHM
TARDOS, E
[J]. COMBINATORICA, 1985, 5 (03) : 247 - 255
[7] A strongly polynomial cut canceling algorithm for the submodular flow problem
Iwata, S
McCormick, ST
Shigeno, M
[J]. INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 1999, 1610 : 259 - 272
[8] A strongly polynomial algorithm for the minimum cost tension problem
Hadjiat, M
Maurras, JF
[J]. DISCRETE MATHEMATICS, 1997, 165 : 377 - 394
[9] A faster capacity scaling algorithm for minimum cost submodular flow
Fleischer, L
Iwata, S
McCormick, ST
[J]. MATHEMATICAL PROGRAMMING, 2002, 92 (01) : 119 - 139
[10] A faster capacity scaling algorithm for minimum cost submodular flow
Lisa Fleischer
Satoru Iwata
S. Thomas McCormick
[J]. Mathematical Programming, 2002, 92 : 119 - 139

← 1 2 3 4 5 →