Relevant bibliographies by topics / Ford-Fulkerson algorithm / Journal articles
To see the other types of publications on this topic, follow the link: Ford-Fulkerson algorithm.

Journal articles on the topic 'Ford-Fulkerson algorithm'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 49 journal articles for your research on the topic 'Ford-Fulkerson algorithm.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Chaibou, Amadou, Ousmane Moussa Tessa, and Oumarou Sié. "Modeling the Parallelization of the Edmonds-Karp Algorithm and Application." Computer and Information Science 12, no. 3 (2019): 81. http://dx.doi.org/10.5539/cis.v12n3p81.

Full text
Abstract:
Many optimization problems can be reduced to the maximum flow problem in a network. However, the maximum flow problem is equivalent to the problem of the minimum cut, as shown by Fulkerson and Ford (Fulkerson & Ford, 1956). There are several algorithms of the graph’s cut, such as the Ford-Fulkerson algorithm (Ford & Fulkerson, 1962), the Edmonds-Karp algorithm (Edmonds & Karp, 1972) or the Goldberg-Tarjan algorithm (Goldberg & Tarjan, 1988). In this paper, we study the parallel computation of the Edmonds-Karp algorithm which is an optimized version of
APA, Harvard, Vancouver, ISO, and other styles
2

Dumlao, Menchita F., Jayvee Ryan F. Banal, and Arriane E. Livara. "Gap Analysis of Ford-Fulkerson Algorithm and Edmonds-Karp Algorithm as Machine Learning Approach for Augmentation Path in the Maximum Flow Problem." International Journal in Information Technology in Governance, Education and Business 3, no. 1 (2021): 30–35. http://dx.doi.org/10.32664/ijitgeb.v3i1.83.

Full text
Abstract:
The maximum flow problem is popular with many researchers as it plays a significant role in many areas. This problem is about obtaining the maximum flow where there is one source and sink in the network flow. In solving maximum flow problems, many algorithms are applied such as the most used are the Ford-Fulkerson Algorithm and the Edmonds-Karp Algorithm. The goal of this study is to identify the gaps of these two algorithms and sufficiently provide an analysis and comparison of their time complexity, simplicity, and effectiveness to solve the augmentation path in the maximum flow problem. The
APA, Harvard, Vancouver, ISO, and other styles
3

Wagner, Donald K. "Graphs with no K3,3 Minor Containing a Fixed Edge." International Journal of Combinatorics 2013 (March 20, 2013): 1–7. http://dx.doi.org/10.1155/2013/783710.

Full text
Abstract:
It is well known that every cycle of a graph must intersect every cut in an even number of edges. For planar graphs, Ford and Fulkerson proved that, for any edge e, there exists a cycle containing e that intersects every minimal cut containing e in exactly two edges. The main result of this paper generalizes this result to any nonplanar graph G provided G does not have a K3,3 minor containing the given edge e. Ford and Fulkerson used their result to provide an efficient algorithm for solving the maximum-flow problem on planar graphs. As a corollary to the main result of this paper, it is shown
APA, Harvard, Vancouver, ISO, and other styles
4

Haftom, Gebreanenya. "Maximum Flow Problem in Ethiopian Airlines." Journal of Progressive Research in Mathematics 9, no. 2 (2016): 1371–80. https://doi.org/10.5281/zenodo.3976734.

Full text
Abstract:
Maximum flow problem is a problem which involves a directed network with arcs carrying flow. The problem is to find the maximum flow that can be sent through the arcs of the network from some specified node S, called the source, to a second specified node T, called the sink. In this paper we are going to see what maximum flow problem is and its solution algorithm called the Ford and Fulkerson algorithm. This paper also contains a problem of maximum flow problem in Ethiopian Airlines solved using the Ford and Fulkerson algorithm.
APA, Harvard, Vancouver, ISO, and other styles
5

Yiltas-Kaplan, Derya. "Traffic Optimization with Software-Defined Network Controller on a New User Interface." JUCS - Journal of Universal Computer Science 28, no. (6) (2022): 648–69. https://doi.org/10.3897/jucs.80625.

Full text
Abstract:
Software-defined networking (SDN) has emerged as a solution to the cumbersome structures of classical computer networks. It separates control and data planes to give independence to devices with respect to either traffic routing or network management. The two isolated planes communicate with each other via the help of software modules, which are located in an SDN controller, such as Floodlight, NOX, or Ryu. In this study, Floodlight is used and an SDN topology with 20 switches is constructed with Python code in Mininet. All algorithms have been coded with Java. The default routing algorithm in
APA, Harvard, Vancouver, ISO, and other styles
6

Bulut, Merve, and Evrencan Özcan. "Optimization of electricity transmission by Ford–Fulkerson algorithm." Sustainable Energy, Grids and Networks 28 (December 2021): 100544. http://dx.doi.org/10.1016/j.segan.2021.100544.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Ibrahim, Iman Youssif, and Ibrahim M. I. Zebari. "A Comprehensive Review of the Ford-fulkerson Algorithm for Network Flow Problems." Asian Journal of Research in Computer Science 18, no. 3 (2025): 335–44. https://doi.org/10.9734/ajrcos/2025/v18i3597.

Full text
Abstract:
The Ford-Fulkerson method is one of the basic algorithms for computing the maximum flow in a flow network. This identifies more frequent traversed paths as a means of maximizing the flow between a source node and a downstream node in a directed network. Therefore, this paper will present a literature review, the principles of the algorithm, its mathematical foundation, applications and improvements made to the algorithm, such as the use of breadth-first search (BFS) as in the Edmonds-Karp algorithm, parallel computing techniques and predictive modeling to enhance efficiency. However, the algor
APA, Harvard, Vancouver, ISO, and other styles
8

Akhmediyarova, Ainur, Dinara Kassymova, Anar Utegenova, and Irbulat Utepbergenov. "Development and research of the algorithm for determining the maximum flow at distribution in the network." Open Computer Science 6, no. 1 (2016): 213–18. http://dx.doi.org/10.1515/comp-2016-0017.

Full text
Abstract:
AbstractAn upgraded version of Ford-Fulkerson algorithm is proposed, which allows to determine the maximum flow and the distribution flow in branches of the network. Results of simulation using this algorithm are given. They show its effectiveness in comparison with the other variants of flow distribution in the network at change of the capacity of branches randomly in time.
APA, Harvard, Vancouver, ISO, and other styles
9

Masadeh, Raja, Abdullah Alzaqebah, Bushra Smadi, and Esra Masadeh. "Parallel Whale Optimization Algorithm for Maximum Flow Problem." Modern Applied Science 14, no. 3 (2020): 30. http://dx.doi.org/10.5539/mas.v14n3p30.

Full text
Abstract:
Maximum Flow Problem (MFP) is considered as one of several famous problems in directed graphs. Many researchers studied MFP and its applications to solve problems using different techniques. One of the most popular algorithms that are employed to solve MFP is Ford-Fulkerson algorithm. However, this algorithm has long run time when it comes to application with large data size. For this reason, this study presents a parallel whale optimization (PWO) algorithm to get maximum flow in a weighted directed graph. The PWO algorithm is implemented and tested on datasets with different sizes. The PWO al
APA, Harvard, Vancouver, ISO, and other styles
10

Shin, Kwang, and Steve Corder. "Implementing the ford-fulkerson labeling algorithm with fixed-order scanning." Computers & Operations Research 19, no. 8 (1992): 783–87. http://dx.doi.org/10.1016/0305-0548(92)90017-y.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

Souza, Felipe Ribeiro, Michel Melo, and Cláudio Lúcio Lopes Pinto. "A proposal to find the ultimate pit using Ford Fulkerson algorithm." Rem: Revista Escola de Minas 67, no. 4 (2014): 389–95. http://dx.doi.org/10.1590/0370-44672014670166.

Full text
Abstract:
The present study is focused on mining planning with an emphasis on the graph theory model proposed by Lerchs-Grossmann. The original paper published by Lerchs-Grossmann about determination of optimum final pit does not report the computational algorithm to solve the problem. This paper discusses and presents an algorithm based on the maximum flow graph computational work from Ford Fulkerson. The main steps for solving the problem and the results of the two-dimensional models are discussed.
APA, Harvard, Vancouver, ISO, and other styles
12

Mukherjee, Taniya, Isha Sangal, Biswajit Sarkar, and Tamer M. Alkadash. "Mathematical estimation for maximum flow of goods within a cross-dock to reduce inventory." Mathematical Biosciences and Engineering 19, no. 12 (2022): 13710–31. http://dx.doi.org/10.3934/mbe.2022639.

Full text
Abstract:
<abstract><p>Supply chain management has recently renovated its strategy by implementing a cross-docking scheme. Cross-docking is a calculated logistics strategy where freight emptied from inbound vehicles is handled straightforwardly onto outbound vehicles, eliminating the intermediate storage process. The cross-docking approach thrives on the minimum storage time of goods in the inventory. Most of the cross-docks avail temporary storage docks where items can be stored for up to 24 hours before being packed up for transportation. The storage capacity of the cross-dock varies depen
APA, Harvard, Vancouver, ISO, and other styles
13

Vallabh Shinde. "Utilizing The Max-Flow Min-Cut Theorem: Ford-Fulkerson Algorithm for Traffic Congestion Management." Panamerican Mathematical Journal 35, no. 2s (2024): 132–44. https://doi.org/10.52783/pmj.v35.i2s.2423.

Full text
Abstract:
This research paper explores the application of the Ford-Fulkerson algorithm to analyze road traffic congestion in Kharadi Bypass, Pune a rapidly urbanizing city facing severe traffic management challenges. Traffic congestion has become a significant urban transport issue, resulting from the increasing number of vehicles and insufficient road infrastructure to accommodate the growing urban population. This article deals with the identification of maximum flow in the road traffic of Pune through the Ford-Fulkerson algorithm, which is well-established in graph theory. The study identifies critic
APA, Harvard, Vancouver, ISO, and other styles
14

Boluma Mangata, Bopatriciat, Mate Landry Gilgen, Tebua Tene Patience Ryan, Takamba Makwem Hanse, and Oshasha Oshasha Fiston. "Road traffic analysis on the congestion problem using the Ford-Fulkerson algorithm." Put i saobraćaj 68, no. 4 (2022): 19–25. http://dx.doi.org/10.31075/pis.68.04.03.

Full text
Abstract:
In this paper, the well-known Ford-Fulkerson algorithm in graph theory is used to determine the maximum flow in a road traffic network. Road traffic congestion is a major urban transport problem that occurs when the volume of traffic exceeds the capacity of existing road facilities. The manifestation of traffic congestion is due to the ownership of a high number of vehicles at the expense of road traffic infrastructure and the high growth of the urban population. Only one road connects the city center of Kinshasa, which concentrates the main activities of the inhabitants, to the international
APA, Harvard, Vancouver, ISO, and other styles
15

Marpaung, Faridawaty, Arnita Arnita, and Nila Sari. "Maximal Flow of Transportation Network in Medan City Using Ford-Fulkerson Algorithm." International Journal of Science, Technology & Management 4, no. 1 (2023): 100–106. http://dx.doi.org/10.46729/ijstm.v4i1.724.

Full text
Abstract:
Transportation is a major component of living, government, and social systems. Tsocio-demographic conditions influence the performance. In this study has a purpose as an investigation of an event that measures the maximal capacity of the road as a way to overcome congestion. Searching for the maximal flow based upon the graph formed using the Ford-Fulkerson Algorithm with numerous stages, namely determining the possible pathway through the source point to the main point arranged in numerous iterations by analyzing the graph formed. Then the initialization process is given by zero flow from eac
APA, Harvard, Vancouver, ISO, and other styles
16

ESANU, Mihai, and Sergiu CORLAT. "A comparative study of maximum matching algorithms." Acta et commentationes: Științe ale Educației 35, no. 1 (2024): 97–102. http://dx.doi.org/10.36120/2587-3636.v35i1.97-102.

Full text
Abstract:
One of the central problems of discrete optimization is the problem of determining the maximal matching, which can be solved in various ways, depending on the structure of the initial data. In this article, a comparative study of the efficiency of maximal flow algorithms (Ford-Fulkerson) and the direct algorithm for determining maximal matching (Even & Kariv) on unweighted bipartite graphs is conducted. The analysis is based on a set of high-difficulty computing competition problems. Therefore, the results will be useful not only to those interested in the maximal matching problem but also
APA, Harvard, Vancouver, ISO, and other styles
17

Gong, Yuqian. "Traffic Flow Prediction and Application of Smart City Based on Industry 4.0 and Big Data Analysis." Mathematical Problems in Engineering 2022 (August 1, 2022): 1–11. http://dx.doi.org/10.1155/2022/5397861.

Full text
Abstract:
For smart city traffic flow prediction in the period of big data and industry 4.0, the prediction accuracy is low, the prediction is difficult, and the prediction effect is different in different geographical locations. This paper proposes a smart city traffic communication forecast based on Industry 4.0 and big data analysis application. Firstly, this paper theoretically explains the application scenario of urban traffic fault text big data and analyzes the characteristics of related problems, especially the fault problems. Secondly, the AC traffic prediction algorithm is studied, and the app
APA, Harvard, Vancouver, ISO, and other styles
18

Ferreira, Joao, Gustavo Callou, Dietmar Tutsch, and Paulo Maciel. "PLDAD—An Algorihm to Reduce Data Center Energy Consumption." Energies 11, no. 10 (2018): 2821. http://dx.doi.org/10.3390/en11102821.

Full text
Abstract:
Due to the demands of new technologies such as social networks, e-commerce and cloud computing, more energy is being consumed in order to store all the produced data. While these new technologies require high levels of availability, a reduction in the cost and environmental impact is also expected. The present paper proposes a power balancing algorithm (power load distribution algorithm-depth (PLDA-D)) to optimize the energy distribution of data center electrical infrastructures. The PLDA-D is based on the Bellman and Ford–Fulkerson flow algorithms that analyze energy-flow models (EFM). EFM co
APA, Harvard, Vancouver, ISO, and other styles
19

Kovalev, K. E., and A. V. Novichikhin. "Ford-Fulkerson algorithm refinement for the cooperation effectiveness increase of intensive and low-density lines." Journal of Physics: Conference Series 2131, no. 3 (2021): 032008. http://dx.doi.org/10.1088/1742-6596/2131/3/032008.

Full text
Abstract:
Abstract The article describes tools of the railway control on intensive and low-density lines which is directed on the effectiveness increase of low-density line functioning, for the solution of perspective tasks of the railway network functioning and development. For the too realization the oriented graph with the Ford-Fulkerson algorithm which allows determining the maximum flow and the minimum cut for non-oriented graphs. Firstly as values of graph tops inverse values of the station rating and as graph edges inverse values of the railway line class are accepted. The use of this approach al
APA, Harvard, Vancouver, ISO, and other styles
20

Than Kyi, Myint, San San Maw, and Lin Lin Naing. "Mathematical Estimation for Maximum Flow in Electricity Distribution Network by Ford-Fulkerson Iteration Algorithm." International Journal of Scientific and Research Publications (IJSRP) 9, no. 8 (2019): p9229. http://dx.doi.org/10.29322/ijsrp.9.08.2019.p9229.

Full text
APA, Harvard, Vancouver, ISO, and other styles
21

Căruţaşu, Vasile. "An Elementary Method of Determining Hamiltonian Paths in Oriented Graphs that Admit Circuits." International conference KNOWLEDGE-BASED ORGANIZATION 31, no. 3 (2025): 31–36. https://doi.org/10.2478/kbo-2025-0076.

Full text
Abstract:
Abstract Determining Hamiltonian paths in oriented graphs that do not support circuits is a simple matter. However, to determine Hamiltonian paths in oriented graphs that admit circuits, things are more complicated. One approach in this regard is the Ford-Fulkerson method, which proves ineffective when we have only one equivalence class, and the only method that generally works is the Latin matrix method in which the concatenation operation is used. In this study, another way of determining the Hamiltonian paths is proposed, which is based on elementary operations and which uses, with certain
APA, Harvard, Vancouver, ISO, and other styles
22

Voronkov, I. M., V. I. Mukhamadiev, M. A. Nazarov, and A. V. Sinitsyn. "Ford-fulkerson and genetic algorithm application for optimal distribution of network resources under financial constraints." Informatization and communication 1 (January 2021): 7–14. http://dx.doi.org/10.34219/2078-8320-2021-12-1-7-14.

Full text
Abstract:
The article is devoted to finding the optimal network resources distribution in the network represented by anundirected complete connected planar uplifted graph. It is assumed that the weight of the edge of the graph is determined by the minimum bandwidth(traffic) of the router at its nodes. The functional is the sum of the bandwidth (maximal flow) of the routers on all nodes under the restrictions on their total cost. The complexity of the problem lies in the fact that there are two types of uncertainty in it: the first – the type of router in each network node is not initially determined, th
APA, Harvard, Vancouver, ISO, and other styles
23

Shrivastava, Akash. "Graph and its Computer Application with C++ Using Linked Lists." Advanced Materials Research 667 (March 2013): 186–92. http://dx.doi.org/10.4028/www.scientific.net/amr.667.186.

Full text
Abstract:
An effort is made to develop a computer programme using C++ to explain the working of a adjacency linked-list representation of a directed graph or digraph and explain the allocation of data using C++. The program uses the concept of arranging a graph in the form of a linked list for the computer to understand the graphical form representation of any data. The graph algorithms are a significant field of interest within computer science. Typical higher level operations associated with graphs are; finding a path between two nodes, like depth-first search and breadth-first search and finding the
APA, Harvard, Vancouver, ISO, and other styles
24

Ekanayake, E. M. U. S. B., W. B. Daundasekara, and S. P. C. Perera. "New Approach to Obtain the Maximum Flow in a Network and Optimal Solution for the Transportation Problems." Modern Applied Science 16, no. 1 (2022): 30. http://dx.doi.org/10.5539/mas.v16n1p30.

Full text
Abstract:
The maximum flow problem is also one of the highly regarded problems in the field of optimization theory in which the objective is to find a feasible flow through a flow network that obtains the maximum possible flow rate from source to sink. The literature demonstrates that different techniques have been developed in the past to handle the maximum amount of flow that the network can handle. The Ford-Fulkerson algorithm and Dinic's Algorithm are the two major algorithms for solving these types of problems. Also, the Max-Flow Min-Cut Theorem, the Scaling Algorithm, and the Push&ndas
APA, Harvard, Vancouver, ISO, and other styles
25

Topolski, Mariusz. "Management of intelligent internal transport through computer-based probabilistic algorithms." AUTOBUSY – Technika, Eksploatacja, Systemy Transportowe 19, no. 6 (2018): 968–72. http://dx.doi.org/10.24136/atest.2018.211.

Full text
Abstract:
This article presents a proposal proprietary approach to the task of optimizing transport processes. In modern logistics, there is a very high complexity of the transport processes. The development of technology has made the systems are becoming more complex. This generates high costs and quite often only approximate the best solutions. The model shows the connection classifier Ford-Fulkerson network flow algorithm Demstera-Shafer theory based on mathematical records. This method is used to obtain the limit problems (tasks) transport. This method is based inter alia on the cost matrix, which m
APA, Harvard, Vancouver, ISO, and other styles
26

Ouyang, Ruizhi, Yang Wang, Qin Gao, Xinlu Li, Qihang Li, and Kaiye Gao. "Optimal Water Level Prediction and Control of Great Lakes Based on Multi-Objective Planning and Fuzzy Control Algorithm." Sustainability 17, no. 8 (2025): 3690. https://doi.org/10.3390/su17083690.

Full text
Abstract:
The optimal water level prediction and control of the Great Lakes is critical for balancing ecological, economic, and societal demands. This study proposes a multi-objective planning model integrated with a fuzzy control algorithm to address the conflicting interests of stakeholders and dynamic hydrological complexities. First, a network flow model is established to capture the interconnected flow dynamics among the five Great Lakes, incorporating lake volume equations derived from paraboloid-shaped bed assumptions. Multi-objective optimization aims to maximize hydropower flow while minimizing
APA, Harvard, Vancouver, ISO, and other styles
27

Moreno-Baca, Fabricio, Patricia Cano-Olivos, José Luis Martínez-Flores, and Diana Sánchez-Partida. "Supply Chain Resilience in California: Targeted-Efficient Spillover Methodology." International Journal of Combinatorial Optimization Problems and Informatics 16, no. 3 (2025): 92–105. https://doi.org/10.61467/2007.1558.2025.v16i2.327.

Full text
Abstract:
The world has changed drastically in logistical and economic spheres as a result of the COVID-19 pandemic. This pandemic has caused a global crisis in supply-chain structures, creating regional, national and international impacts of unprecedented magnitude. Accordingly, this research develops a methodology to favour the logistics-resilience framework based on regional externalities and technical-efficiency analysis of the 51 US states, applying a Spatial Data Panel model and a Stochastic Frontier model in conjunction with graph theory (Ford–Fulkerson algorithm). The findings indicate that New
APA, Harvard, Vancouver, ISO, and other styles
28

Chhabi Lal Bhusal. "A Survey on Models of Flows over Time with Flow Dependent Transit Times." Prāgyik Prabāha 12, no. 1 (2024): 1–13. http://dx.doi.org/10.3126/pp.v12i1.69961.

Full text
Abstract:
Ford and Fulkerson introduce the maximum dynamic flow problems with fixed transit times on the arcs and developed the first well known algorithm that sends maximum flow from the source to the sink by augmenting along s-t paths and prove the maximum amount of flow is equal to the total capacity of the arcs in minimum cut. In flows over time with fixed transit time on the arc, the time it takes to traverse an arc does not depend on the current flow situation on the arc. But in real situation, the flow units travelling on the same arc at the same time do not necessarily experience the same pace,
APA, Harvard, Vancouver, ISO, and other styles
29

Sheng, Jiayin, Xinjie Guan, Fuliang Yang, and Xili Wan. "An Accelerated Maximum Flow Algorithm with Prediction Enhancement in Dynamic LEO Networks." Sensors 25, no. 8 (2025): 2555. https://doi.org/10.3390/s25082555.

Full text
Abstract:
Efficient data transmission in low Earth orbit (LEO) satellite networks is critical for supporting real-time global communication, Earth observation, and numerous data-intensive space missions. A fundamental challenge in these networks involves solving the maximum flow problem, which determines the optimal data throughput across highly dynamic topologies with limited onboard energy and data processing capability. Traditional algorithms often fall short in these environments due to their high computational costs and inability to adapt to frequent topological changes or fluctuating link capaciti
APA, Harvard, Vancouver, ISO, and other styles
30

Spridon, Delia Elena, Adrian Marius Deaconu, and Javad Tayyebi. "Novel GPU-Based Method for the Generalized Maximum Flow Problem." Computation 13, no. 2 (2025): 40. https://doi.org/10.3390/computation13020040.

Full text
Abstract:
This paper investigates the application of a minimum loss path finding algorithm to determine the maximum flow in generalized networks that are characterized by arc losses or gains. In these generalized network flow problems, each arc has not only a defined capacity but also a loss or gain factor, which must be taken into consideration when calculating the maximum achievable flow. This extension of the traditional maximum flow problem requires a more comprehensive approach, where the maximum amount of flow is determined by accounting for additional factors such as costs, varying arc capacities
APA, Harvard, Vancouver, ISO, and other styles
31

Beyi, Amanuel, and Temesgen Godana. "The Maximum Attainable Flow and Minimal Cost Problem in a Network." American Journal of Mathematical and Computer Modelling 9, no. 2 (2024): 22–38. http://dx.doi.org/10.11648/j.ajmcm.20240902.11.

Full text
Abstract:
This paper, presents an efficient algorithm that solves such a large class of optimization problems. Ford-Fulkerson determines the maximum flow in a network by iteratively augmenting flow paths until no further improvement is possible. On the other hand, Dijkstra's algorithm excels in finding the shortest path in a weighted graph, making it suitable for minimizing costs in network traversal. However, this paper simultaneously optimizes both objectives (flow and cost) dependently in unique iterations by considering all constraints and objectives holistically. The aim of this work is to
APA, Harvard, Vancouver, ISO, and other styles
32

Li, Yuke, Keyu Chen, and Zhuojun Zhao. "Dynamic Network Modeling of Optimal Water Level Control Based on RMOBM and DMOWN." Highlights in Science, Engineering and Technology 107 (August 15, 2024): 497–505. http://dx.doi.org/10.54097/gnsjmh62.

Full text
Abstract:
In this paper, the optimal water level of the Great Lakes and their connected waterways in North America is studied by using the multi-objective bargaining model based on water level risk (RMOBM model) and the dynamic multi-objective basin network (DMOWN model). First of all, we established the RMOBM model, taking into account the influence of rainfall, snowfall, evaporation of lake water and surface leakage on water level, and carried out multiple rounds of bargaining with the objective function of maximizing economic benefits and minimizing the probability of flood occurrence, and obtained t
APA, Harvard, Vancouver, ISO, and other styles
33

Oliveira, Juliane Fonseca, Adriano O. Vasconcelos, Andrêza L. Alencar, et al. "Balancing Human Mobility and Health Care Coverage in Sentinel Surveillance of Brazilian Indigenous Areas: Mathematical Optimization Approach." JMIR Public Health and Surveillance 11 (April 1, 2025): e69048-e69048. https://doi.org/10.2196/69048.

Full text
Abstract:
Abstract Background Optimizing sentinel surveillance site allocation for early pathogen detection remains a challenge, particularly in ensuring coverage of vulnerable and underserved populations. Objective This study evaluates the current respiratory pathogen surveillance network in Brazil and proposes an optimized sentinel site distribution that balances Indigenous population coverage and national human mobility patterns. Methods We compiled Indigenous Special Health District (Portuguese: Distrito Sanitário Especial Indígena [DSEI]) locations from the Brazilian Ministry of Health and estimate
APA, Harvard, Vancouver, ISO, and other styles
34

Malyshev, M. I. "Research review on improving the efficiency of multimodal transportation based on technological solutions." Civil Aviation High Technologies 23, no. 4 (2020): 58–71. http://dx.doi.org/10.26467/2079-0619-2020-23-4-58-71.

Full text
Abstract:
During the process of analyzing Russian and foreign studies in the field of multimodal cargo transportation, existing methods for improving the efficiency of the multimodal transport system are considered. Improving efficiency of multimodal transportation today is possible due to the optimization of the interaction system between the used modes of transport and transportation of goods. Cost reduction, optimization of cargo terminals, the formation and development of the transport corridors network also play an important role in improving this type of transportation. The use of the new capabili
APA, Harvard, Vancouver, ISO, and other styles
35

Ivannikov, Vadim V. "Graph Model of Steel Distribution on the Ship’s Hull." Marine Technology and SNAME News 37, no. 03 (2000): 153–61. http://dx.doi.org/10.5957/mt1.2000.37.3.153.

Full text
Abstract:
This paper discusses the task of optimizing vessel hull steel distribution by means of a graph model. Optimal and suboptimal options as far as the dimensions and steel grades are concerned are found by means of linear programming methods—the Dejikstra or Ford-Fulkerson flow algorithms. The suggested method has been used for an economically effective solution for utilizing high-strength shipbuilding steel and corrosion-proof steel for train-ferries in operation as well as for those being designed.
APA, Harvard, Vancouver, ISO, and other styles
36

B. K., Prabhakara, Chandrakant Naikodi, and Suresh L. "Ford Fulkerson and Newey West Regression Based Dynamic Load Balancing in Cloud Computing for Data Communication." International Journal of Computer Network and Information Security 15, no. 5 (2023): 81–95. http://dx.doi.org/10.5815/ijcnis.2023.05.08.

Full text
Abstract:
In Cloud Computing (CC) environment, load balancing refers to the process of optimizing resources of virtual machines. Load balancing in the CC environment is one of the analytical approaches utilized to ensure indistinguishable workload distribution and effective utilization of resources. This is because only by ensuring effective balance of dynamic workload results in higher user satisfaction and optimal allocation of resource, therefore improve cloud application performance. Moreover, a paramount objective of load balancing is task scheduling because surges in the number of clients utilizin
APA, Harvard, Vancouver, ISO, and other styles
37

Sriwahyuni, Lilis, Marwan Marwan, and Zata Yumni Awanis. "Optimization of water flow on Regency Municipality Waterworks-network of Jonggat Central Lombok Regency using Ford Fulkerson Algorithm and Dinic Algorithm." EIGEN MATHEMATICS JOURNAL, June 27, 2023, 49–54. http://dx.doi.org/10.29303/emj.v6i1.157.

Full text
Abstract:
Clean water is essential for humans which must be fulfilled for humans survival. The population in Jonggat, Central Lombok, increases from year to year which causes the using of clean water get an increase too. The necessity of rising clean water is not in line with the availability of water in nature, therefore the PDAM (Regency Municipality Waterworks) manages existing water resource. Then, it will be distributed to consumers. The purpose of this research is to determine the optimal solution in the distribution of clean water in Jonggat using Ford Fulkerson algorithm and Dinic algorithm. Bot
APA, Harvard, Vancouver, ISO, and other styles
38

Turchina, V. A., and K. P. Gulko. "Application of the Ford-Falkerson algorithm to detect excess information." Problems of applied mathematics and mathematic modeling, November 28, 2019. http://dx.doi.org/10.15421/321919.

Full text
Abstract:
The object of the article is the network maximum flow algorithm, mainly the Ford-Fulkerson algorithm. The algorithm began to be developed by two scientists: Ford and Fulkerson. This algorithm was proposed in order to find the maximum flow in the network. They began to be actively studied by scientists from the middle of the last century. The first report of "Maximum Network Flow" dates back to 1954. The authors of the report, Ford and Fulkerson had proved the theorem on the maximum flow and the minimum cross section for non-oriented graphs: the value of the maximum flow in the network is equal
APA, Harvard, Vancouver, ISO, and other styles
39

"Detection of Prostate Cancer Related Genes using Modified Ford-Fulkerson Algorithm in Protein-to-Protein Interaction Network." International Journal of Engineering and Advanced Technology 8, no. 6 (2019): 1595–601. http://dx.doi.org/10.35940/ijeat.f8198.088619.

Full text
Abstract:
Prostate cancer is a malignancy cancer that affects prostate epithelial cells. Presently, prostate cancer is the second leading cause of cancer-related death in men. In this research, a new computational system was proposed for determining the prostate cancer related genes with the shortest path methodology in a Protein to Protein Interaction (PPI) network. Here, a weighted PPI network was constructed on the basis of PPI data from Search Tool for the Retrieval of Interacting Genes/Proteins (STRING) database. Totally, eighteen prostate related genes were extracted from the STRING database by us
APA, Harvard, Vancouver, ISO, and other styles
40

Abd. Majid, Khairani, Suzaimah Ramli, Zaharin Yusoff, Norazman Mohamad Nor, and Nor Afiza Mat Razali. "ON MAXIMUM FLOW OF NETWORKS." Journal of Defence Science, Engineering & Technology 6, no. 1 (2023). https://doi.org/10.58247/jdset-2023-0601-02.

Full text
Abstract:
This paper aims to introduce and discuss two existing algorithms, namely Ford-Fulkerson’s Algorithm and Dinic’s Algorithm. These algorithms are for determining the maximum flow from source (s) to sink (t) in a flow network. A numerical example is solved to illustrate both algorithms, and to demonstrate, study, and compare the procedures at each iteration. The results show that Dinic’s Algorithm returns the maximum flow that takes a smaller number of iterations and augmentations than the Ford-Fulkerson Algorithm. In terms of complexity, the running time of Dinic’s algorithm is O(n^2m), which sh
APA, Harvard, Vancouver, ISO, and other styles
41

"Determination of the optimal launch batch in the machine tool system for small and medium-sized engineering enterprises." Automation. Modern Techologies, 2020, 16–19. http://dx.doi.org/10.36652/0869-4931-2020-74-3-16-19.

Full text
Abstract:
The methodology for determining the optimal start-up lot in the machine tool system for small and medium¬sized engineering enterprises is considered. The methodology based on a multi-product network, the Ford-Fulker- son algorithm and the developed integer-valued linear programming task is considered. Keywords: launch party; capacity determination task; Ford—Fulkerson algorithm; mathematical model; methodology for determining the optimal launch batch.
APA, Harvard, Vancouver, ISO, and other styles
42

Jackson, State University. "ON THE PROBABILITY OF K-CONNECTIVITY IN WIRELESS AD HOC NETWORKS UNDER DIFFERENT MOBILITY MODELS." March 8, 2019. https://doi.org/10.5121/jgraphoc.2010.2301.

Full text
Abstract:
We compare the probability of k-Connectivity of an ad hoc network under Random Way Point (RWP), City Section and Manhattan mobility models. A Network is said to be k-Connected if there exists at least k edge disjoint paths between any pair of nodes in that network at any given time and velocity. Initially, for each of the three mobility models, the movement of the each node in the ad hoc network at a given velocity and time are captured and stored in the Node Movement Database (NMDB). Using the movements in the NMDB, the location of the node at a given time is computed and stored in the Node L
APA, Harvard, Vancouver, ISO, and other styles
43

Natarajan, Meghanathan, and Gorla Sireesha. "ON THE PROBABILITY OF K-CONNECTIVITY IN WIRELESS AD HOC NETWORKS UNDER DIFFERENT MOBILITY MODELS." June 23, 2021. https://doi.org/10.5281/zenodo.5018069.

Full text
Abstract:
We compare the probability of k-Connectivity of an ad hoc network under Random Way Point (RWP), City Section and Manhattan mobility models. A Network is said to be k-Connected if there exists at least k edge disjoint paths between any pair of nodes in that network at any given time and velocity. Initially, for each of the three mobility models, the movement of the each node in the ad hoc network at a given velocity and time are captured and stored in the Node Movement Database (NMDB). Using the movements in the NMDB, the location of the node at a given time is computed and stored in the Node L
APA, Harvard, Vancouver, ISO, and other styles
44

C, Latha, and K. Perumal. "An Efficient Brain Tumour Extraction in MR Images using Ford-Fulkerson Algorithm." Transactions on Machine Learning and Artificial Intelligence 4, no. 2 (2016). http://dx.doi.org/10.14738/tmlai.42.1875.

Full text
APA, Harvard, Vancouver, ISO, and other styles
45

Kyi, Myint Than, and Lin Lin Naing. "Application of Ford-Fulkerson Algorithm to Maximum Flow in Water Distribution Pipeline Network." International Journal of Scientific and Research Publications (IJSRP) 8, no. 12 (2018). http://dx.doi.org/10.29322/ijsrp.8.12.2018.p8441.

Full text
APA, Harvard, Vancouver, ISO, and other styles
46

Alsalami, Omar Mutab, and Ali Muhammad Ali Rushdi. "A Review of Flow-Capacitated Networks: Algorithms, Techniques and Applications." Asian Journal of Research in Computer Science, March 19, 2021, 1–33. http://dx.doi.org/10.9734/ajrcos/2021/v7i330179.

Full text
Abstract:
This paper presents a review of flow network concepts, including definition of some graph-theoretic basics and a discussion of network flow properties. It also provides an overview of some crucial algorithms used to solve the maximum-flow problem such as the Ford and Fulkerson algorithm (FFA), supplemented with alternative solutions, together with the essential terminology for this algorithm. Moreover, this paper explains the max-flow min-cut theorem in detail, analyzes the concepts behind it, and provides some examples and their solutions to demonstrate this theorem. As a bonus, it expounds t
APA, Harvard, Vancouver, ISO, and other styles
47

ÖZTEMİZ, Furkan. "AMFC: A New Approach Efficient Junctions Detect via Maximum Flow Approach." Bitlis Eren Üniversitesi Fen Bilimleri Dergisi, October 23, 2023. http://dx.doi.org/10.17798/bitlisfen.1325877.

Full text
Abstract:
In this study, max flow analysis processes are carried out with a graph theory-based approach that can be used in optimizing the traffic load in transportation networks. The data used in the study consists of 2 years of vehicle number data consisting of 438 million vehicle passes of a real city. Bottleneck points affecting traffic flow, maximum flow values, and effectiveness values of traffic generating and attracting locations were determined in the uniquely created transportation network. The Ford-Fulkerson algorithm was used to determine the maximum flow and bottleneck road connections in t
APA, Harvard, Vancouver, ISO, and other styles
48

Popov, Alexey. "On the Implementation of the Ford-Fulkerson Algorithm in the Multiple Instructions and Single Data Computer System." Science and Education of the Bauman MSTU 14, no. 09 (2014). http://dx.doi.org/10.7463/0914.0726416.

Full text
APA, Harvard, Vancouver, ISO, and other styles
49

Kudler-Flam, Jonah, Vladimir Narovlansky, and Shinsei Ryu. "Negativity spectra in random tensor networks and holography." Journal of High Energy Physics 2022, no. 2 (2022). http://dx.doi.org/10.1007/jhep02(2022)076.

Full text
Abstract:
Abstract Negativity is a measure of entanglement that can be used both in pure and mixed states. The negativity spectrum is the spectrum of eigenvalues of the partially transposed density matrix, and characterizes the degree and “phase” of entanglement. For pure states, it is simply determined by the entanglement spectrum. We use a diagrammatic method complemented by a modification of the Ford-Fulkerson algorithm to find the negativity spectrum in general random tensor networks with large bond dimensions. In holography, these describe the entanglement of fixed-area states. It was found that ma
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography