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.
Supported in partVerified against the publisher's abstract
Pollack's abstract defines the maximum-capacity route (widest path) problem, but does not state that the same frontier algorithm computes it, nor supply the edge-min bottleneck metric.
“The maximum capacity route is defined to be the route between any two given cities (nodes) that allows the greatest flow.”
- 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¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Read against the text for 1 of 1 citation: 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:2930a048df2f · see in the full table