Letter to the Editor---The Maximum Capacity Through a Network

Maurice Pollack
Additional contact information
Maurice Pollack: Stanford Research Institute, Menlo Park, California

Operations Research, 1960, vol. 8, issue 5, 733-736

Abstract: The maximum capacity route is defined to be the route between any two given cities (nodes) that allows the greatest flow. This differs from the maximum capacity problem [1] in that only the single best route is desired, in the maximum capacity problem, the object is to find the maximum flow between two nodes using as many different routes as needed. The maximum capacity route problem arises in automatic teletype networks where, for any given origin-destination pair, there is only one route specified.

Date: 1960
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.8.5.733 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:8:y:1960:i:5:p:733-736

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().