Zobrazeno 1 - 10
of 219
pro vyhledávání: '"Push–relabel maximum flow algorithm"'
Autor:
Fedir Sokhatsky, Iryna V. Fryz
Publikováno v:
Discrete Mathematics. 340:1957-1966
We propose an algorithm for constructing orthogonal n-ary operations which is called a block composition algorithm here. Input data of the algorithm are two series of different arity operations being distributed by blocks. The algorithm consists of t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c54c4197712ebf6475c05dac06c96822
https://doi.org/10.1016/j.disc.2016.11.012
https://doi.org/10.1016/j.disc.2016.11.012
Publikováno v:
Numerical Heat Transfer, Part B: Fundamentals. 71:425-442
This paper proposes an efficient segregated solution procedure for the two-dimensional incompressible fluid flow on unstructured grids. The new algorithm is called SIMPLERR (SIMPLERR-revised algorithm). It includes an inner iterative process that con
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4073283c49858d0e22336019a2071b31
https://doi.org/10.1080/10407790.2017.1293965
https://doi.org/10.1080/10407790.2017.1293965
Publikováno v:
Annals of Operations Research. 272:29-39
Flow variations over time generalize standard network flows by introducing an element of time. In contrast to the classical case of static flows, a flow over time in such a network specifies a flow rate entering an arc for each point in time. In this
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::81131d922b802f666d6353acffb1aade
https://doi.org/10.1007/s10479-017-2450-2
https://doi.org/10.1007/s10479-017-2450-2
Autor:
Nasser A. El-Sherbeny
Publikováno v:
Journal of Mathematical Sciences: Advances and Applications. 43:1-18
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aa9536efd95cc2c5afa51d5677785db1
https://doi.org/10.18642/jmsaa_7100121736
https://doi.org/10.18642/jmsaa_7100121736
Autor:
Masahide Saho, Maiko Shigeno
Publikováno v:
Networks. 69:179-188
Given a directed graph with a capacity and a transit time for each arc and with single source and single sink nodes, the quickest flow problem is to find the minimum time horizon to send a given amount of flow from the source to the sink. This is one
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b7ddc532ed22f4e24daeba19d80a8cc0
https://doi.org/10.1002/net.21726
https://doi.org/10.1002/net.21726
Publikováno v:
Discrete Optimization. 22:20-36
We investigate variants of the max-flow problem in a network under k attacks. The network interdiction problem is to find the minimum max-flow value among (mk) networks that can be obtained by deleting each set of k links. The adaptive network flow p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::27dafbfb0a4c03a6132f134d83e8b712
https://doi.org/10.1016/j.disopt.2016.05.002
https://doi.org/10.1016/j.disopt.2016.05.002
Publikováno v:
Applied Soft Computing. 40:654-673
A novel predictive measure that predicts which algorithm is best at any given point in time. Always select the predicted best algorithm to run for the next generation.The performance of our method is very competitive if viewed as another novel "indiv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9032042d272ec72c482f45fec34dc9b3
https://doi.org/10.1016/j.asoc.2015.12.021
https://doi.org/10.1016/j.asoc.2015.12.021
Autor:
Kalyan Kumar Mallick, Aminur Rahman Khan, Mollah Mesbahuddin Ahmed, Md. Shamsul Arefin, Md. Sharif Uddin
Publikováno v:
Open Journal of Applied Sciences. :131-140
Maximum Flow Problem (MFP) discusses the maximum amount of flow that can be sent from the source to sink. Edmonds-Karp algorithm is the modified version of Ford-Fulkerson algorithm to solve the MFP. This paper presents some modifications of Edmonds-K
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6283f14dbd41b0a0782590eaccbf2606
https://doi.org/10.4236/ojapps.2016.62014
https://doi.org/10.4236/ojapps.2016.62014
Autor:
Ran Duan, Kurt Mehlhorn
Publikováno v:
Information and Computation. 243:112-132
We present the first combinatorial polynomial time algorithm for computing the equilibrium of the Arrow-Debreu market model with linear utilities. Our algorithm views the allocation of money as flows and iteratively improves the balanced flow as in 1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5ec9aea5ae7ae66052293a73c09f2653
https://doi.org/10.1016/j.ic.2014.12.009
https://doi.org/10.1016/j.ic.2014.12.009
Autor:
A. S. Chebotareva, V. A. Skorokhodov
Publikováno v:
Journal of Applied and Industrial Mathematics. 9:435-446
We consider the problem of finding a maximum flow in networks with strictly and nonstrictly determined flow distribution. We show that, for each condition of flow distribution, a solution to the problem under consideration exists and is unique. Some
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8ee12fdbf0042d572471888f9e955e1f
https://doi.org/10.1134/s199047891503014x
https://doi.org/10.1134/s199047891503014x