Results 11 to 20 of about 281,096 (215)
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
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
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
Coordinator MPC for maximizing plant throughput [PDF]
Modeling, Identification and Control, 2008 In many cases economic optimal operation is the same as maximum plant throughput, which is the same as maximum flow through the bottleneck(s). This insight may greatly simplify implementation. In this paper, we consider the case where the bottlenecks may
Elvira M.B. Aske +2 more
doaj +1 more source
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 +1 more source
Flows in Generalized Nets with Related Arcs
Моделирование и анализ информационных систем, 2015 The problem of finding the maximum flow in nets of a special form is considered. In such nets the arcs are related in such a way that the total flow passing through the related arcs does not exceed the minimum throughput of these arcs.
V. A. Skorokhodov
doaj +3 more sources
Solving Robust Variants of Integer Flow Problems with Uncertain Arc Capacities
Promet (Zagreb), 2021 This paper deals with robust optimization and network flows. Several robust variants of integer flow problems are considered. They assume uncertainty of network arc capacities as well as of arc unit costs (where applicable).
Marko Špoljarec, Robert Manger
doaj +1 more source
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 +1 more source