The Maximum Capacity Through a Network¶
Pollack, M. (1960). The Maximum Capacity Through a Network. Operations Research, 8(5), 733-736.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Path
- The bottleneck role appears in a sibling problem: swap the sum-of-weights objective for a max-of-weights (or min-of-capacities) objective and the very same frontier algorithm computes the widest path, whose limiting step is its worst edge, exactly the edge-min metric the signature names.
This sourceThe widest-path (maximum-capacity / bottleneck) problem, whose limiting step is the path's worst edge under a max-min metric.
- The bottleneck role appears in a sibling problem: swap the sum-of-weights objective for a max-of-weights (or min-of-capacities) objective and the very same frontier algorithm computes the widest path, whose limiting step is its worst edge, exactly the edge-min metric the signature names.
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:2930a048df2f · see in the full table