Inverse Generalized Maximum Flow Problems
Mathematics, 2019 A natural extension of maximum flow problems is called the generalized maximum flow problem taking into account the gain and loss factors for arcs. This paper investigates an inverse problem corresponding to this problem. It is to increase arc capacities
Javad Tayyebi, Adrian Deaconu
doaj +2 more sources
Novel GPU-Based Method for the Generalized Maximum Flow Problem
ComputationThis 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.
Delia Elena Spridon +2 more
doaj +2 more sources
The maximum flow problem with disjunctive constraints [PDF]
Journal of Combinatorial Optimization, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ulrich Pferschy, Joachim Schauer
openaire +2 more sources
On the history of the transportation and maximum flow problems [PDF]
Mathematical Programming, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources
Maximum Entropy Method for Solving the Turbulent Channel Flow Problem
Entropy, 2019 There are two components in this work that allow for solutions of the turbulent channel flow problem: One is the Galilean-transformed Navier-Stokes equation which gives a theoretical expression for the Reynolds stress (u′v′); and the second ...
T.-W. Lee
doaj +1 more source
Efficient Algorithms on Multicommodity Flow over Time Problems with Partial Lane Reversals
International Journal of Mathematics and Mathematical Sciences, 2020 The multicommodity flow problem arises when several different commodities are transshipped from specific supply nodes to the corresponding demand nodes through the arcs of an underlying capacity network.
Urmila Pyakurel +3 more
doaj +1 more source
Solving the Max-Flow Problem on a Quantum Annealing Computer
IEEE Transactions on Quantum Engineering, 2020 This article addresses the question of implementing a maximum flow algorithm on directed graphs in a formulation suitable for a quantum annealing computer. Three distinct approaches are presented.
Thomas Krauss +4 more
doaj +1 more source
A computational evaluation of constructive heuristics for the parallel blocking flow shop problem with sequence-dependent setup times [PDF]
, 2021 This paper deals with the problem of scheduling jobs in a parallel flow shop environment without buffers between machines and with sequence-dependent setup times in order to minimize the maximum completion time of jobs.
Companys Pascual, Ramón +1 more
core +1 more source
Optimal Decision-Making Dealing with Enemy Sabotages Using the Maximum Flow Interdiction Problem in Multi-Period Dynamic Networks in Fuzzy Conditions [PDF]
آیندهپژوهی دفاعی, 2022 For a long time, one of the most important problems in wars has been the enemy's operations to destroy facilities and communication networks. The destruction of bridges and roads, air, missile, or artillery attacks, and the countless cyber-attacks in ...
Hamid Bigdeli, Salim Bavandi
doaj +1 more source
Improved Time Bounds for the Maximum Flow Problem [PDF]
SIAM Journal on Computing, 1989 Summary: Recently, \textit{A. V. Goldberg} [A new max-flow algorithm, Tech. Rep. MIT/LCS/TM-291, Lab. Comput. Sci., Mass. Inst. Technol. (Cambridge/MA 1985)] proposed a new approach to the maximum network flow problem. The approach yields a very simple algorithm running in \(O(n^ 3)\) time on n- vertex networks.
Ravindra K. Ahuja +2 more
openaire +1 more source