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

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!