An Alternate Linear Algorithm for the Minimum Flow Problem

1999 ◽  
Vol 50 (2) ◽  
pp. 177
Author(s):  
V. G. Adlakha
Keyword(s):  
Flow Problem ◽  
Linear Algorithm ◽  
Minimum Flow ◽  
Minimum Flow Problem

An alternate linear algorithm for the minimum flow problem

1999 ◽  
Vol 50 (2) ◽  
pp. 177-182
Author(s):  
V G Adlakha
Keyword(s):  
Flow Problem ◽  
Linear Algorithm ◽  
Minimum Flow ◽  
Minimum Flow Problem

scholarly journals A deficit scaling algorithm for the minimum flow problem

Sadhana ◽  
2006 ◽  
Vol 31 (3) ◽  
pp. 227-233 ◽  
Author(s):  
Laura Ciupală
Keyword(s):  
Flow Problem ◽  
Minimum Flow ◽  
Minimum Flow Problem

scholarly journals Incremental Minimum Flow Algorithms

Mathematics ◽  
2021 ◽  
Vol 9 (9) ◽  
pp. 1025
Author(s):  
Laura Ciupala ◽  
Adrian Deaconu
Keyword(s):  
Lower Bound ◽  
High Frequency ◽  
Network Flow ◽  
Flow Problem ◽  
Computation Method ◽  
Minimum Flow ◽  
Flow Problems ◽  
Initial Network ◽  
Minimum Flow Problem ◽  
Real World Problems

There are various situations in which real-world problems can be modeled and solved as minimum flow problems. Sometimes, in these situations, minor data changes may occur, leading to corresponding changes of the networks in which the practical problems are modeled as flow problems, such as slight variations in capacity or lower bound. For instance, the capacity or the lower bound of an arc may increase or decrease in time, leaving one with no other choice than finding the new minimum network flow. Given both the various ways in which the networks can be changed and the high frequency of these changes, it is desirable to find as fast a computation method for minimum flow as possible. This paper is focused on the cases that concern increasing and decreasing the capacity or the lower bound of an arc. For these cases, both the minimum flow algorithms and the dynamic minimum flow algorithms that are already known are inefficient. Our incremental algorithms for determining minimum flow in the modified network are more efficient than both the above-mentioned types of algorithms. The proposed method starts from the initial network minimum flow and solves the minimum flow problem in a significantly faster way than recalculating the new network minimum flow starting from scratch.

A polynomial time algorithm for the minimum flow problem in time-varying networks

2017 ◽  
Vol 272 (1-2) ◽  
pp. 29-39 ◽  
Author(s):  
S. Khodayifar ◽  
M. A. Raayatpanah ◽  
P. M. Pardalos
Keyword(s):  
Polynomial Time ◽  
Flow Problem ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Time Varying ◽  
Minimum Flow ◽  
Time Varying Networks ◽  
Minimum Flow Problem

Inverse minimum flow problem

2007 ◽  
Vol 23 (1-2) ◽  
pp. 193-203 ◽  
Author(s):  
Eleonor Ciurea ◽  
Adrian Deaconu
Keyword(s):  
Flow Problem ◽  
Minimum Flow ◽  
Minimum Flow Problem

scholarly journals Solving the minimum flow problem with interval bounds and flows

Sadhana ◽  
2012 ◽  
Vol 37 (6) ◽  
pp. 665-674
Author(s):  
MEHDI GHIYASVAND
Keyword(s):  
Flow Problem ◽  
Minimum Flow ◽  
Minimum Flow Problem

scholarly journals ALGORITHM OF THE INVERSE MINIMUM FLOW PROBLEM WITH TIME-WINDOWS

2017 ◽  
Vol 43 ◽  
pp. 1-18
Author(s):  
Nasser A. El-Sherbeny
Keyword(s):  
Flow Problem ◽  
Time Windows ◽  
Minimum Flow ◽  
Minimum Flow Problem

scholarly journals Minimum flow problem on network flows with time-varying bounds

2012 ◽  
Vol 36 (9) ◽  
pp. 4414-4421 ◽  
Author(s):  
H. Salehi Fathabadi ◽  
S. Khodayifar ◽  
M.A. Raayatpanah
Keyword(s):  
Flow Problem ◽  
Network Flows ◽  
Time Varying ◽  
Minimum Flow ◽  
Minimum Flow Problem

scholarly journals Inverse minimum flow problem under the weighted sum-type Hamming distance

2017 ◽  
Vol 229 ◽  
pp. 101-112 ◽  
Author(s):  
Longcheng Liu ◽  
Wenhao Zheng ◽  
Chao Li
Keyword(s):  
Flow Problem ◽  
Hamming Distance ◽  
Weighted Sum ◽  
Minimum Flow ◽  
Minimum Flow Problem
Sign in / Sign up

Export Citation Format

Share Document