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

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!