Results 231 to 240 of about 270,354 (261)

The Maximum Energy-Constrained Dynamic Flow Problem

2008
We study a natural class of flow problems that occur in the context of wireless networks; the objective is to maximize the flow from a set of sources to one sink node within a given time limit, while satisfying a number of constraints. These restrictions include capacities and transit times for edges; in addition, every node has a bound on the amount ...
Sándor P. Fekete, Alexander Hall, Ekkehard Köhler, Alexander Kröller   +3 more
openaire   +1 more source

The value of information in stochastic maximum flow problems

Computers & Operations Research, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rasool Tahmasbi, Ebrahim Nasrabadi, S. Mehdi Hashemi   +2 more
openaire   +1 more source

Strong Duality for the Maximum Borel Flow Problem

2011
Research on flows over time has been conducted mainly in two separate and independent approaches, namely discrete and continuous models, depending on whether a discrete or continuous representation of time is used. Recently, Borel flows have been introduced to build a bridge between these two models.
Ronald Koch, Ebrahim Nasrabadi
openaire   +1 more source

Problem of Maximum Flow in Networks

1987
The present chapter deals with the analogy that exists between the problem of maximum flow in networks [15] and equilibrium problems for physical systems described in Secs.7.2, 7.4 and 7.5 of the present chapter. We shall discuss models which differ among themselves only in the mechanical properties that cause constraints.
openaire   +1 more source

Balancing Applied to Maximum Network Flow Problems

2006
We explore balancing as a definitional and algorithmic tool for finding minimum cuts and maximum flows in ordinary and parametric networks. We show that a standard monotonic parametric maximum flow problem can be formulated as a problem of computing a particular maximum flow that is balanced in an appropriate sense.
Robert Endre Tarjan, Julie Ward, Bin Zhang 0004, Yunhong Zhou, Jia Mao   +4 more
openaire   +1 more source

Research on the Maximum Flow Problem with Multiple Solutions

2010 2nd International Workshop on Database Technology and Applications, 2010
his paper introduces multiple solutions to maximum flow and presents a simple approach to work out some special maximum flows. The result by the algorithm has double meanings: that is to say, the maximum flow not only has saturated edges as many as possible, but also has edges as small as possible, namely more zero-flow edges.
openaire   +1 more source

The Maximum Flow Problem with Conflict and Forcing Conditions

2011
We study the maximum flow problem subject to binary disjunctive constraints in a directed graph: A negative disjunctive constraint states that a certain pair of arcs in a digraph cannot be simultaneously used for sending flow in a feasible solution. In contrast to this, positive disjunctive constraints force that for certain pairs of arcs at least one ...
Ulrich Pferschy, Joachim Schauer
openaire   +1 more source

A strongly polynomial algorithm for the minimum maximum flow degree problem

Operations Research Letters, 2023
Jhonata Matias, Manoel Campelo
exaly  

The Maximum Beer Flow Problem

Theoretical Computer Science
Wing-Kai Hon, Yu-Jia Huang, Wang-Yang Li
openaire   +1 more source

Flow Switching Approach to the Maximum Flow Problem: I

Journal of the ACM, 1977
Bharat Kinariwala, A. G. Rao
openaire   +2 more sources