Maximum-Flow Neural Network: A Novel Neural Network for the Maximum Flow Problem
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2009 In advance of network communication society by the internet, the way how to send data fast with a little loss becomes an important transportation problem. A generalized maximum flow algorithm gives the best solution for the transportation problem that which route is appropriated to exchange data.
Masatoshi Sato, Hisashi Aomori
exaly +2 more sources
Approximation algorithm for maximum flow network interdiction problem [PDF]
Iranian Journal of Numerical Analysis and Optimization, 2020 We consider the maximum flow network interdiction problem. We provide a new interpretation of the problem and define a concept called ”optimalcut”.
M. Afsharirad
doaj +1 more source
Maximum Flow Interdiction Problem in Multi-Period Dynamic Networks in Fuzzy Stochastic Hybrid Conditions [PDF]
مجله مدل سازی در مهندسی, 2023 Undoubtedly, the best tool to help military decision-makers and commanders choose the appropriate strategy is to formulate models that are as close to the real world as possible.
Salim Bavandi +2 more
doaj +1 more source
Designing Graphical User Interface (GUI) for Adjustable Robust Maximum Flow Problem
Jurnal Matematika Integratif, 2021 Maximum flow problem is one of optimization problems which aims to find the maximum flow value that is traversed in a network system. This problem can be solved using existing algorithms and linear programming.
Diah Chaerani +3 more
doaj +1 more source
A new approach to the maximum flow problem [PDF]
Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86, 1986 All previously known efficient maximum-flow algorithms work by finding augmenting paths, either one path at a time (as in the original Ford and Fulkerson algorithm) or all shortest-length augmenting paths at once (using the layered network approach of Dinic).
Andrew V. Goldberg, Robert Endre Tarjan
openaire +2 more sources
The inverse maximum flow problem with lower and upper bounds for the flow [PDF]
Yugoslav Journal of Operations Research, 2008 The general inverse maximum flow problem (denoted GIMF) is considered, where lower and upper bounds for the flow are changed so that a given feasible flow becomes a maximum flow and the distance (considering l1 norm) between the initial vector of bounds ...
Deaconu Adrian
doaj +1 more source
Using the binary representation of arc capacity in a polynomial time algorithm for the constrained maximum flow problem in directed networks [PDF]
Network Biology, 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.
Muhammad Tlas
doaj
Engineering Bi-Connected Component Overlay for Maximum-Flow Parallel Acceleration in Large Sparse Graph [PDF]
Xibei Gongye Daxue Xuebao, 2018 Network maximum flow problem is important and basic in graph theory, and one of its research directions is maximum-flow acceleration in large-scale graph.
doaj +1 more source
A polynomial time algorithm for the maximal constrained network flow problem based on the bit-arc capacity scaling technique [PDF]
Network Biology, 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 problem ...
Muhammad Tlas
doaj
Flow Network Models for Online Scheduling Real-Time Tasks on Multiprocessors
IEEE Access, 2020 We consider the flow network model to solve the multiprocessor real-time task scheduling problems. Using the flow network model or its generic form, linear programming (LP) formulation, for the problems is not new.
Hyeonjoong Cho, Arvind Easwaran
doaj +1 more source