𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Investing in arcs in a network to maximize the expected max flow

✍ Scribed by Stein W. Wallace

Publisher
John Wiley and Sons
Year
1987
Tongue
English
Weight
808 KB
Volume
17
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Identifying regular blocks in valued net
Identifying regular blocks in valued networks: A heuristic applied to the St. Marks carbon flow data, and international trade in cereal products
✍ Carl Nordlund πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 501 KB

While the concept of regular equivalence is equally applicable to dichotomous as well as valued networks, the identification of regular blocks in regular blockmodels is somewhat problematic when dealing with valued networks. Applying the standard procedure for identifying ties in such blockmodels, a