Technical Note—Maximal Funnel-Node Flow in an Undirected Network

John J. Jarvis and Duane D. Miller
Additional contact information
John J. Jarvis: Georgia Institute of Technology, Atlanta, Georgia
Duane D. Miller: Office of the Assistant Vice Chief of Staff, United States Army, Washington, D.C.

Operations Research, 1973, vol. 21, issue 1, 365-369

Abstract: This note formulates, examines, and solves a funnel-node maximal-flow problem for an undirected network. The solution procedure requires only applications of the single-commodity flow algorithm, and is therefore extremely efficient. Several applications are presented.

Date: 1973
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.21.1.365 (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:21:y:1973:i:1:p:365-369

Access Statistics for this article

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