Use of dynamic trees in a network simplex algorithm for the maximum flow problem

Andrew V. Goldberg; Michael D. Grigoriadis; Robert E. Tarjan

doi:10.1007/bf01594940

Use of dynamic trees in a network simplex algorithm for the maximum flow problem

Mathematical Programming ◽

10.1007/bf01594940 ◽

1991 ◽

Vol 50 (1-3) ◽

pp. 277-290 ◽

Cited By ~ 33

Author(s):

Andrew V. Goldberg ◽

Michael D. Grigoriadis ◽

Robert E. Tarjan

Keyword(s):

Flow Problem ◽

Maximum Flow ◽

Simplex Algorithm ◽

Maximum Flow Problem ◽

Network Simplex Algorithm ◽

Dynamic Trees ◽

Network Simplex

Download Full-text

Efficiency of the Network Simplex Algorithm for the Maximum Flow Problem

10.21236/ada214691 ◽

1988 ◽

Author(s):

Andrew V. Goldberg ◽

Michael D. Grigoriadis ◽

Robert E. Tarjan

Keyword(s):

Flow Problem ◽

Maximum Flow ◽

Simplex Algorithm ◽

Maximum Flow Problem ◽

Network Simplex Algorithm ◽

Network Simplex

Download Full-text

On strongly polynomial variants of the network simplex algorithm for the maximum flow problem

Operations Research Letters ◽

10.1016/0167-6377(91)90039-r ◽

1991 ◽

Vol 10 (7) ◽

pp. 383-387 ◽

Cited By ~ 12

Author(s):

Donald Goldfarb ◽

Jianxiu Hao

Keyword(s):

Flow Problem ◽

Maximum Flow ◽

Simplex Algorithm ◽

Maximum Flow Problem ◽

Network Simplex Algorithm ◽

Network Simplex ◽

Strongly Polynomial

Download Full-text

A specialized network simplex algorithm for the constrained maximum flow problem

European Journal of Operational Research ◽

10.1016/j.ejor.2010.10.018 ◽

2011 ◽

Vol 210 (2) ◽

pp. 137-147 ◽

Cited By ~ 7

Author(s):

Cenk Çalışkan

Keyword(s):

Flow Problem ◽

Maximum Flow ◽

Simplex Algorithm ◽

Maximum Flow Problem ◽

Network Simplex Algorithm ◽

Network Simplex

Download Full-text

NETWORK SIMPLEX ALGORITHM ASSOCIATED WITH THE MAXIMUM FLOW PROBLEM

Far East Journal of Mathematical Sciences (FJMS) ◽

10.17654/ms104010119 ◽

2018 ◽

Vol 104 (1) ◽

pp. 119-132

Author(s):

Sennosuke Watanabe ◽

Hodaka Tanaka ◽

Yoshihide Watanabe

Keyword(s):

Flow Problem ◽

Maximum Flow ◽

Simplex Algorithm ◽

Maximum Flow Problem ◽

Network Simplex Algorithm ◽

Network Simplex

Download Full-text

Parallel network simplex algorithm for the minimum cost flow problem

Concurrency and Computation Practice and Experience ◽

10.1002/cpe.6659 ◽

2021 ◽

Author(s):

Gökçehan Kara ◽

Can Özturan

Keyword(s):

Flow Problem ◽

Minimum Cost ◽

Simplex Algorithm ◽

Minimum Cost Flow ◽

Network Simplex Algorithm ◽

Minimum Cost Flow Problem ◽

Parallel Network ◽

Cost Flow ◽

Network Simplex

Download Full-text

On strongly polynomial variants of the MBU-simplex algorithm for a maximum flow problem with non-zero lower bounds

Optimization ◽

10.1080/02331934.2013.800515 ◽

2013 ◽

Vol 63 (1) ◽

pp. 39-47 ◽

Cited By ~ 2

Author(s):

Tibor Illés ◽

Richárd Molnár-Szipai

Keyword(s):

Lower Bounds ◽

Flow Problem ◽

Maximum Flow ◽

Simplex Algorithm ◽

Maximum Flow Problem ◽

Strongly Polynomial

Download Full-text

Dynamic trees as search trees via euler tours, applied to the network simplex algorithm

Mathematical Programming ◽

10.1007/bf02614369 ◽

1997 ◽

Vol 78 (2) ◽

pp. 169-177 ◽

Cited By ~ 24

Author(s):

Robert E. Tarjan

Keyword(s):

Simplex Algorithm ◽

Search Trees ◽

Network Simplex Algorithm ◽

Dynamic Trees ◽

Euler Tours ◽

Network Simplex

Download Full-text

Network simplex algorithm for the general equal flow problem

European Journal of Operational Research ◽

10.1016/s0377-2217(02)00505-2 ◽

2003 ◽

Vol 150 (3) ◽

pp. 585-600 ◽

Cited By ~ 15

Author(s):

Herminia I. Calvete

Keyword(s):

Flow Problem ◽

Simplex Algorithm ◽

Network Simplex Algorithm ◽

Network Simplex

Download Full-text

A primal simplex algorithm that solves the maximum flow problem in at mostnm pivots and O(n 2 m) time

Mathematical Programming ◽

10.1007/bf01580869 ◽

1990 ◽

Vol 47 (1-3) ◽

pp. 353-365 ◽

Cited By ~ 27

Author(s):

Donald Goldfarb ◽

Jianxiu Hao

Keyword(s):

Flow Problem ◽

Maximum Flow ◽

Simplex Algorithm ◽

Maximum Flow Problem

Download Full-text

Modified bounded dual network simplex algorithm for solving minimum cost flow problem with fuzzy costs based on ranking functions

Journal of Intelligent & Fuzzy Systems ◽

10.3233/ifs-2012-0545 ◽

2013 ◽

Vol 24 (1) ◽

pp. 191-198 ◽

Cited By ~ 9

Author(s):

A. Ebrahimnejad ◽

S.H. Nasseri ◽

S.M. Mansourzadeh

Keyword(s):

Flow Problem ◽

Minimum Cost ◽

Simplex Algorithm ◽

Ranking Functions ◽

Minimum Cost Flow ◽

Network Simplex Algorithm ◽

Minimum Cost Flow Problem ◽

Cost Flow ◽

Network Simplex

Download Full-text