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á bibliografie

Vydáno v:	Network biology Ročník 15; číslo 2; s. 48 - 66
Hlavní autor:	Tlas, Muhammad
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Hong Kong International Academy of Ecology and Environmental Sciences (IAEES) 01.06.2025 International Academy of Ecology and Environmental Sciences
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!