Sentence examples for maximum flow problem from inspiring English sources

We show that upon convergence, the steady-state voltages in the circuit capture the solution to the maximum flow problem.

For solving the maximum flow problem of the DTN, an appropriate model should be built first.

These results extend the classical minimum cost maximum flow problem and the minimum cut problem to a class of security games on flow networks.

In this paper, we study the maximum flow problem through our proposed storage time aggregated graph (STAG) for DTNs.

In this paper, we generalize the capacity-scaling techniques in the design of algorithms for the maximum flow problem.

We develop a minimum cost flow algorithm for the case in which demands may be split across multiple rings, and provide a transformation to a maximum flow problem for specially structured data.

Besides being the optimization workhorse of machine learning, first-order methods have recently served as a springboard for a number of algorithmic advances in discrete optimization, including submodular optimization and maximum flow problems.

Pferschy and Schauer [33] prove that the maximum flow problems with both negative and positive disjunctive constraints are NP-hard and do not admit a Polynomial-Time Approximation Scheme (PTAS).

and and as defined in the section describing the formulation of the combinatorial optimization, The minimum-cost maximum-flow problem is stated as follows: where represents the signed supply value for each node, defined as For any solution to the minimum-cost maximum-flow problem stated above, the edges with represent the annotations of cell x i with label.

With this construction and the efficient algorithm for solving the maximum-flow problem, we can conveniently obtain association scores for candidate diseases as the total amount of net flow leaving the diseases and then rank the diseases according to their scores.

The Sparsest Cut (SC) is often introduced as a weak dual of the Maximum Concurrent Flow problem (MCF).