has been cited by the following article(s):
|
[1]
|
Maximum Flow by Network Reconstruction Method
|
|
International Conference on …,
2023 |
|
|
|
|
[2]
|
Interconnection network analysis through ve-degree-based information functional entropy and complexity
|
|
… Physical Journal Plus,
2023 |
|
|
|
|
[3]
|
TransMCL enables the assembly of full‐length coding genes for collecting complete hierarchical orthogroups
|
|
Methods in Ecology and …,
2023 |
|
|
|
|
[4]
|
An intelligent node labelling maximum flow algorithm
|
|
International Journal of …,
2023 |
|
|
|
|
[5]
|
Extreme Min–Cut Max–Flow Algorithm
|
|
International Journal of …,
2023 |
|
|
|
|
[6]
|
Modifikasi Algoritma Edmonds Karp untuk Menentukan Aliran Maksimum Pada Jaringan Distribusi Air PDAM (Studi Kasus Jaringan Telaga Sari PDAM Giri Menang …
|
|
EIGEN MATHEMATICS …,
2023 |
|
|
|
|
[7]
|
Mathematical estimation for maximum flow of goods within a cross-dock to reduce inventory
|
|
Math. Biosci. Eng,
2022 |
|
|
|
|
[8]
|
New Approach to Obtain the Maximum Flow in a Network and Optimal Solution for the Transportation Problems
|
|
Modern Applied …,
2022 |
|
|
|
|
[9]
|
IMPLEMENTASI ALGORITMA EDMONDS KARP DALAM PENCARIAN ALIRAN MAKSIMUM PADA JARINGAN LISTRIK
|
|
2019 |
|
|
|
|
[10]
|
Performance Analysis of Multi-Hop Wireless Link under Maximum Flow Algorithm
|
|
2019 |
|
|
|
|
[11]
|
Developing Algorithm to Obtain the Maximum Flow in a Network Flow Problem
|
|
Jour of Adv Research in Dynamical & Control Systems,
2019 |
|
|
|
|
[12]
|
Closed parasitic flow loops and dominated loops in networks
|
|
2019 |
|
|
|
|
[13]
|
Comparison for Max-Flow Min-cut Algorithms for Optimal Assignment Problem
|
|
2019 |
|
|
|
|
[14]
|
DISTRIBUSI MAKSIMUM PRODUK PAKAIAN DENGAN MENGGUNAKAN MODIFIKASI ALGORITMA EDMONDSKARP (Studi Kasus: Konveksi Bos …
|
|
2018 |
|
|
|
|
[15]
|
DISTRIBUSI MAKSIMUM PRODUK PAKAIAN DENGAN MENGGUNAKAN MODIFIKASI ALGORITMA EDMONDSKARP (Studi Kasus: Konveksi Bos Herman Di Kota Pekalongan)
|
|
JURNAL MATEMATIKA UNDIP,
2018 |
|
|
|
|
[16]
|
Implementing Resource-Aware Multicast Forwarding in Software Defined Networks
|
|
Trends and Advances in Information Systems and Technologies,
2018 |
|
|
|
|
[17]
|
DISTRIBUSI MAKSIMUM PRODUK PAKAIAN DENGAN MENGGUNAKAN MODIFIKASI ALGORITMA EDMONDSKARP (Studi Kasus: Konveksi Bos Herman Di Kota …
|
|
2018 |
|
|
|
|
[18]
|
A Heuristic on Risk Management System in Goods Transportation Model Using Multi-Optimality by MODI Method
|
|
2016 |
|
|
|
|
[19]
|
A New Approach to Solve the Classical Symmetric Traveling Salesman Problem by Highest Suffix Method
|
|
|
|
|
|
|
[1]
|
Extreme Min – Cut Max – Flow Algorithm
International Journal of Applied Metaheuristic Computing,
2023
DOI:10.4018/IJAMC.322436
|
|
|
|
|
[2]
|
Mathematical estimation for maximum flow of goods within a cross-dock to reduce inventory
Mathematical Biosciences and Engineering,
2022
DOI:10.3934/mbe.2022639
|
|
|
|
|
[3]
|
Trends and Advances in Information Systems and Technologies
Advances in Intelligent Systems and Computing,
2018
DOI:10.1007/978-3-319-77712-2_29
|
|
|
|
|
[4]
|
A Heuristic on Risk Management System in Goods Transportation Model Using Multi-Optimality by MODI Method
Open Journal of Applied Sciences,
2016
DOI:10.4236/ojapps.2016.68054
|
|
|
|