Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Muhammad Tlas"'
Autor:
Muhammad Tlas
Publikováno v:
Network Biology, Vol 13, Iss 4, Pp 122-136 (2023)
An efficient polynomial time algorithm for solving maximum flow problems in directed networks has been proposed in this paper. The algorithm is basically based on successive divisions of capacities by multiples of two; it solves the maximum flow prob
Externí odkaz:
https://doaj.org/article/0ed7ae09a9704990aa6ba28815ce206f
Autor:
Muhammad Tlas
Publikováno v:
Network Biology, Vol 12, Iss 3, Pp 81-96 (2022)
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 pr
Externí odkaz:
https://doaj.org/article/e9584d2c62d34cb099fba3cfa11dc1e3
Publikováno v:
Computational Ecology and Software, Vol 11, Iss 3, Pp 126-141 (2021)
An interactive computer program for multiple nonlinear curves fitting has been developed in this work. Several optimization algorithms have been implemented in this software for solving constrained and unconstrained nonlinear optimization models in o
Externí odkaz:
https://doaj.org/article/de94d0d8506f4fa0b3e4838e2fd79266
Autor:
Muhammad Tlas
Publikováno v:
Network Biology, Vol 11, Iss 2, Pp 82-96 (2021)
A polynomial time algorithm for solving the minimum-cost network flow problem has been proposed in this paper. This algorithm is mainly based on the binary representation of capacities; it solves the minimum-cost flow problem in directed graph of n n
Externí odkaz:
https://doaj.org/article/4154f288caa644309dcd5cd0bf2baba9
Autor:
Nihad Sirees
A mysterious tale-within-a-tale of family secrets by the most prominent Syrian author working today The world is so strange, The strangest things are the stories you overhear. When a hapless bureaucrat finds himself stranded in the countryside during
