✦ LIBER ✦

Computation of maximal flows in networks

✍ Scribed by D. R. Fulkerson; G. B. Dantzig

Publisher: John Wiley and Sons
Year: 1955
Tongue: English
Weight: 350 KB
Volume: 2
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.3800020407

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

A simple computational method, based on the simplex algorithm of linear programming, is proposed for the following problem:

“Consider a network (e.g., rail, road, communication network) connecting two given points by way of a number of intermediate points, where each link of the network has a number assigned to it representing its capacity. Assuming a steady state condition, find a maximal flow from one given point to the other.”

📜 SIMILAR VOLUMES

Characterizing Multiterminal Flow Networ

Characterizing Multiterminal Flow Networks and Computing Flows in Networks of Small Treewidth

✍ Torben Hagerup; Jyrki Katajainen; Naomi Nishimura; Prabhakar Ragde 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 417 KB

We show that if a flow network has k inputÂoutput terminals (for the traditional maximum-flow problem, k=2), its external flow pattern (the possible values of flow into and out of the terminals) has two characterizations of size independent of the total number of vertices: a set of 2 k +1 inequaliti

Maximal expected flow in a network subje

Maximal expected flow in a network subject to arc failures

✍ Y. P. Aneja; K. P. K. Nair 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 494 KB

## Abstract In a network subject to arc failures, each chain has a probability of failure. Therefore the maximal flow in the network is a random variable. The problem considered here is that of maximizing the expected flow. An arc‐chain formulation of the problem, and an algorithm for computing an

Computation of viscoelastic cable coatin

Computation of viscoelastic cable coating flows

✍ I. Mutlu; P. Townsend; M. F. Webster 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 301 KB

A viscoelastic analysis is presented for model tube tooling, draw-down and combined geometry flows encountered in the cable coating industries. The work investigates the development of stress fields and studies the effect of varying entry flow stress boundary conditions. The analysis takes into acco

Universal computation in fluid neural ne

Universal computation in fluid neural networks

✍ Ricard V. Solé; Jordi Delgado 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 158 KB 👁 1 views

Fluid neural networks can be used as a theoretical framework for a wide range of complex systems as social insects. In this article we show that collective logical gates can be built in such a way that complex computation can be possible by means of the interplay between local interactions and the c

Simulation of transient gas flows in net

Simulation of transient gas flows in networks

✍ A. Osiadacz 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 482 KB

A technique is presented for calculating the transient flow in high pressure transportation systems where both simple systems (without compressors) and systems with compressors have been taken into consideration. A partial differential equation characterizing the dynamic gas flow through a pipeline

On multiroute maximum flows in networks

✍ Charu C. Aggarwal; James B. Orlin 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 172 KB

## Abstract Let __G__ = (__N, A__) be a network with a designated source node __s__, a designated sink node __t__, and a finite integral capacity __u~ij~__ on each arc (__i, j__) ∈ __A__. An elementary __K__‐flow is a flow of __K__ units from __s__ to __t__ such that the flow on each arcis 0 or 1.