Biblio Discovery — Demo Discovery Service

5 hasil untuk "Muhammad Tlas"

Menampilkan 1–5 · 0,34 detik · RSS

  1. Artikel Jurnal Teks lengkap

    A bit-arc capacity scaling algorithm for the maximum flow problem subjected to box constraints on the flow vector in digraph

    Muhammad Tlas

    Network Biology, Vol. 15 No. 2 · 2025 · Inggris · DOAJ Dikeluarkan Scopus 2017

    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…

  2. Artikel Jurnal Teks lengkap

    A polynomial time algorithm for the maximal constrained network flow problem based on the bit-arc capacity scaling technique

    Muhammad Tlas

    Network Biology, Vol. 13 No. 4 · 2023 · Inggris · DOAJ Dikeluarkan Scopus 2017

    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 problem as a sequence of O(m) shortest path problems…

  3. Artikel Jurnal Teks lengkap

    Using the binary representation of arc capacity in a polynomial time algorithm for the constrained maximum flow problem in directed networks

    Muhammad Tlas

    Network Biology, Vol. 12 No. 3 · 2022 · Inggris · DOAJ Dikeluarkan Scopus 2017

    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…

  4. Artikel Jurnal Teks lengkap

    A bit-capacity scaling algorithm for the constrained minimal cost network flow problem

    Muhammad Tlas

    Network Biology, Vol. 11 No. 2 · 2021 · Inggris · DOAJ Dikeluarkan Scopus 2017

    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 nodes and m directed arcs as a sequence of O(n2)…

  5. Artikel Jurnal Teks lengkap

    Interactive statistical computer program for multiple non-linear curves fitting using stochastic algorithms

    Muhammad Tlas; Bashar Abdul Ghani; Jamal Asfahani

    Computational Ecology and Software, Vol. 11 No. 3 · 2021 · Inggris · DOAJ

    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 order to evaluate and best-estimate the concerning…