Results 261 to 270 of about 279,848 (302)
Some of the next articles are maybe not open access.
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
Computing and Applications: The Maximum Flow and Minimum Cost – Maximum Flow Problems
2021The maximum flow and minimum cost-maximum flow problems are both concerned with determining flows through a network between a source and a destination. Maximum flow applies to any problem where the objective is move as many as possible goods/objects/people between two locations via intermediate locations.
openaire +2 more sources
Approximation Algorithms for the Maximum Concurrent Flow Problem
ORSA Journal on Computing, 1989The maximum concurrent flow problem (MCFP) is the optimization version of the feasibility problem in multicommodity flows. The objective is to maximize the percentage of the demands which is realizable for all commodities, subject to the capacity constraints. A fully polynomial ϵ-approximate algorithm was developed by Shahrokhi and Matula to solve the
openaire +1 more source
A Hybrid Parallel Implementation for the Maximum Flow Problem
2018 26th Euromicro International Conference on Parallel, Distributed and Network-based Processing (PDP), 2018The maximum flow problem is a classical combinatorial problem with many applications. In this work a hybrid parallel algorithm using both multi-core and many-core technologies for computing the maximum flow in a network is presented. The proposed implementation is applicable in OpenMP/CUDA-enabled computing environment.
Marco Aurelio Stefanes +1 more
openaire +1 more source
The Maximum Nearby Flow Problem
2019We present a new Linear Programming model that formulates the problem of computing the Kantorovich-Wasserstein distance associated with a truncated ground distance. The key idea of our model is to consider only the quantity of mass that is transported to nearby points and to ignore the quantity of mass that should be transported between faraway pairs ...
Auricchio, Gennaro +2 more
openaire +3 more sources
A primal simplex variant for the maximum‐flow problem
Naval Research Logistics Quarterly, 1984Since the ground-breaking work of Ford and Fulkerson, a variety of algorithms featuring good ''worst-case'' bounds have been proposed for the maximum flow problem. Until this paper, there has been very limited computational testing and empirical evaluation reported on these algorithms.
Glover, Fred +3 more
openaire +1 more source
A Maximum Flow Approach to the Volumetric Reconstruction Problem
Procedings of the British Machine Vision Conference 2005, 2005We present a 3D reconstruction technique based on the maximum-flow formulation. Starting with a set of calibrated images, we globally search for the most probable 3D model given the photoconsistency and the spatial continuity constraints. This search is done radially from the center of the reconstruction volume; therefore imposing a radial topology ...
Catherine Proulx, Sébastien Roy 0001
openaire +1 more source
An improved algorithm for solving maximum flow problem
2012 8th International Conference on Natural Computation, 2012There are lots of steps and complicated calculation in the existing algorithm for solving the maximum flow,and because of improper selection order of augmented path, we cannot obtain the ideal maximum flow. In order to solve these problems in existing algorithm, this paper make some improvement of the existing algorithms, then puts forward a new ...
Lifeng Zhao, Xiaowan Meng
openaire +1 more source
Maximum flow problem in distributed environment
1995Our contribution here is to design efficient distributed algorithms for the maximum flow problem. The idea behind our distributed version of highest-label preflow-push algorithm is to disseminate label values together with safety information from every node.
openaire +1 more source
The Maximum Integer Multiterminal Flow Problem
2006Given an edge-capacitated graph and kterminal vertices, the maximum integer multiterminal flow problem (MaxIMTF) is to route the maximum number of flow units between the terminals. For directed graphs, we introduce a new parameter kL ≤ k and prove that MaxIMTF is $\mathcal{NP}$-hard when k = kL = 2 and when kL = 1 and k = 3, and polynomial-time ...
openaire +2 more sources