Results 211 to 220 of about 270,354 (261)
Some of the next articles are maybe not open access.
The maximum flow problem of uncertain network
Information Sciences, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sheng-Wei Han, Zixiong Peng
exaly +3 more sources
The maximum flow problem of uncertain random network
Journal of Ambient Intelligence and Humanized Computing, 2017The maximum flow problem is an important problem of network optimization and it covers a wide range of engineering and management applications. The goal of the problem is to find the maximum amount of flow from the source to the sink in a network. This paper investigates two models of the maximum flow of an uncertain random network under the framework ...
Yuhong Sheng, Sheng Yuhong
exaly +2 more sources
The maximum concurrent flow problem
Journal of the ACM, 1990The maximum concurrent flow problem (MCFP) is a multicommodity flow problem in which every pair of entities can send and receive flow concurrently. The ratio of the flow supplied between a pair of entities to the predefined demand for that pair is called throughput and must be the same for all pairs of entities for ...
Farhad Shahrokhi, David W. Matula
openaire +1 more source
An Incremental Algorithm for the Maximum Flow Problem
Journal of Mathematical Modelling and Algorithms, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
S. Kumar, P. Gupta
openaire +2 more sources
An Algorithm for the Fuzzy Maximum Flow Problem
2007 IEEE International Fuzzy Systems Conference, 2007The problem of finding the maximum flow between a source and a destination node in a network with uncertainties in its capacities is an important problem of network flows, since it has a wide range of applications in different areas (telecommunications, transportations, manufacturing, etc) and therefore deserves special attention.
Fábio Hernandes +4 more
openaire +1 more source
The multiroute maximum flow problem revisited
Networks, 2006AbstractWe are given a directed network G = (V,A,u) with vertex set V, arc set A, a source vertex s ∈ V, a destination vertex t ∈ V, a finite capacity vector u = {uij}(i,j)∈A, and a positive integer m ∈ Z+. The multiroute maximum flow problem (m‐MFP) generalizes the ordinary maximum flow problem by seeking a maximum flow from s to t subject to not only
Donglei Du, R. Chandrasekaran
openaire +1 more source
A Distributed Algorithm for the Maximum Flow Problem
The 4th International Symposium on Parallel and Distributed Computing (ISPDC'05), 2006This paper presents an asynchronous distributed algorithm for solving the maximum flow problem which is based on the preflow-push approach of Golberg-Tarjan. Each node in graph initially knows the capacities of outgoing and incoming adjacent arcs, the source nodes knows additionally the number of nodes in graph.
Thuy Lien Pham +3 more
openaire +1 more source
The Maximum Transmission Switching Flow Problem
Proceedings of the Ninth International Conference on Future Energy Systems, 2018The Maximum Transmission Switching Flow (MTSF) is the problem of maximizing the power flow of a power grid by switching off lines. This static transmission design problem is known to be NP-hard even on strongly restricted graph classes. In this paper, we study the combinatorial structure of the MTSF problem and its relationship to familiar problems. We
Alban Grastien +4 more
openaire +2 more sources
A constrained maximum flow problem†
International Journal of Control, 1971We consider the problem of maximizing the flow from one node to another in an oriented network subject to flow conservation and capacity limitation constraints and the additional constraint that for some nodes a certain positive linear combination of flows entering the node is bounded. Several properties of solutions to this problem are developed and a
M. MALEK-ZAVAKEI, I. T. FRISCH
openaire +1 more source
On solving large maximum concurrent flow problems
Proceedings of the 15th annual conference on Computer Science - CSC '87, 1987The maximum concurrent flow problem (MCFP) is readily illustrated by problems such as traffic flow in road networks and message transfer in packet switched networks. The MCFP was introduced in [MA85] and can be solved using either linear programming techniques or using the flow routing algorithms [BM86, TM86].
Farhad Shahrokhi, David W. Matula
openaire +1 more source