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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Network biology Jg. 15; H. 2; S. 48 - 66
1. Verfasser:	Tlas, Muhammad
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Hong Kong International Academy of Ecology and Environmental Sciences (IAEES) 01.06.2025 International Academy of Ecology and Environmental Sciences
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!