Results 11 to 20 of about 270,354 (261)
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
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
On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow
Journal of Graph Algorithms and Applications, 2020 Given a graph $G=(V,E)$ with two distinguished vertices $s,t\in V$ and an integer $L$, an $L$-bounded flow is a flow between $s$ and $t$ that can be decomposed into paths of length at most $L$. In the maximum $L$-bounded flow problem the task is to find
Kateřina Altmanová +2 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
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.
Ahuja, Ravindra K. +2 more
openaire +3 more sources
Optimization of people evacuation plans on the basis of wireless sensor networks
Open Engineering, 2016 This paper introduces the optimization process for people salvation in critical situations by organizing their evacuation plan from enclosed areas using modern approaches of data acquisition on the basis of wireless sensor networks.
Amirgaliyev Yedilkhan +2 more
doaj +1 more source
A method for the solution of the homogeneous inventory-production optimisation problem
Technical Transactions, 2020 The subject of this paper is the inventory-production problem, which is a one of the optimization problems in a decision area in which inventory volume and production volume are considered together.
Schiff Krzysztof
doaj +1 more source