Using the binary representation of arc capacity in a polynomial time algorithm for the constrained maximum flow problem in directed networks

In this paper, the binary representation of arc capacity has been used in developing an efficient polynomial time algorithm for the constrained maximum flow problem in directed networks. The algorithm is basically based on solving the maximum flow problem as a sequence of O(n2) shortest path problem...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Network biology Ročník 12; číslo 3; s. 81 - 96
Hlavný autor: Tlas, Muhammad
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Hong Kong International Academy of Ecology and Environmental Sciences (IAEES) 01.09.2022
International Academy of Ecology and Environmental Sciences
Predmet:
Algorithms
augmenting path method
Lower bounds
Mathematics
Maximum flow
maximum flow problem
network flow
polynomial time algorithm
Polynomials
Representations
scaling algorithm
Shortest-path problems
Transportation networks
Transportation problem
ISSN:2220-8879
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In this paper, the binary representation of arc capacity has been used in developing an efficient polynomial time algorithm for the constrained maximum flow problem in directed networks. The algorithm is basically based on solving the maximum flow problem as a sequence of O(n2) shortest path problems on residual directed networks with n nodes generated during iterations. The complexity of the algorithm is estimated to be no more than O(n2mr) arithmetic operations, where m denotes the number of arcs in the network, and r is the smallest integer greater than or equal to log B (B denotes the largest arc capacity in the directed network). Generalization of the algorithm has been also performed in order to solve the maximum flow problem in a directed network subject to non-negative lower bound on the flow vector. A formulation of the simple transportation problem, as a maximal network flow problem has been also performed. Numerical example has been inserted to illustrate the use of the proposed algorithm.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2220-8879