A bit-arc capacity scaling algorithm for the maximum flow problem subjected to box constraints on the flow vector in digraph

A bit-arc capacity scaling algorithm to solve the maximal flow problem subjected to box constraints on the flow vector in directed network has been presented. The algorithm is mainly based on successive divisions of capacities by multiples of two. It solves the maximal flow problem as a sequence of...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Network biology Ročník 15; číslo 2; s. 48 - 66
Hlavný autor: Tlas, Muhammad
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Hong Kong International Academy of Ecology and Environmental Sciences (IAEES) 01.06.2025
International Academy of Ecology and Environmental Sciences
Predmet:
Algorithms
augmenting path method
Biology
Constraints
digraph
Graph theory
Labeling
Maximum flow
maximum flow problem
network flow
Nodes
polynomial time algorithm
scaling algorithm
Shortest-path problems
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í:A bit-arc capacity scaling algorithm to solve the maximal flow problem subjected to box constraints on the flow vector in directed network has been presented. The algorithm is mainly based on successive divisions of capacities by multiples of two. It solves the maximal flow problem as a sequence of O(n2) Dijkstra's shortest path between two nodes in the defined residual network with n nodes and m arcs. It is proven that, the algorithm's complexity was estimated to be no more than O(n2mr) arithmetic operations in the worst case to reach the maximum vector flow through the directed network. Where r denotes to the smallest integer greater than or equal to log B, and B denotes to the largest arc capacity of the network. A numerical example has been illustrated using the proposed algorithm.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2220-8879