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

Optimization ◽  
2013 ◽  
Vol 63 (1) ◽  
pp. 39-47 ◽  
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

Strongly polynomial dual simplex methods for the maximum flow problem

1998 ◽  
Vol 80 (1) ◽  
pp. 17-33 ◽  
Author(s):  
Ronald D. Armstrong ◽  
Wei Chen ◽  
Donald Goldfarb ◽  
Zhiying Jin
Keyword(s):  
Flow Problem ◽  
Maximum Flow ◽  
Maximum Flow Problem ◽  
Dual Simplex ◽  
Simplex Methods ◽  
Strongly Polynomial

A Combinatorial Algorithm for Generalized Maximum Flow Problem in Lossy Network

2012 ◽  
Vol 263-266 ◽  
pp. 2295-2300
Author(s):  
Li Wei Dong ◽  
Xiaofen Zhang ◽  
Hong Wang
Keyword(s):  
Flow Problem ◽  
Maximum Flow ◽  
Dijkstra’S Algorithm ◽  
Combinatorial Algorithm ◽  
Residual Network ◽  
Maximum Flow Problem ◽  
Dijkstra's Algorithm ◽  
Augmenting Path ◽  
Strongly Polynomial

This paper first presents the method for finding a generalized augmenting path according to the idea of Dijkstra's algorithm. Then the combinatorial algorithm for solving the generalized maximum flow is given in lossy network. The algorithm runs in strongly polynomial times by finding the generalized f-augmenting path in a generalized residual network.

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

1991 ◽  
Vol 50 (1-3) ◽  
pp. 277-290 ◽  
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

scholarly journals Two Flow Problems in Dynamic Networks

2016 ◽  
Vol 12 (1) ◽  
pp. 103 ◽  
Author(s):  
Camelia Schiopu ◽  
Eleonor Ciurea
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Flow Problem ◽  
Dynamic Networks ◽  
Maximum Flow ◽  
Flow Problems ◽  
Maximum Flow Problem

In this paper we study two flow problems: the feasible flow problem in dynamic networks and the maximum flow problem in bipartite dynamic networks with lower bounds. We mention that the maximum flow problem in bipartite dynamic networks with lower bound was presented in paper [8]a. For these problems we give examples.

Sign in / Sign up

Export Citation Format

Share Document