Technical Note—Maximal Funnel-Node Flow in an Undirected Network
John J. Jarvis, Duane D. Miller
Operations Research · 1973 · Volume 21 · Issue 1
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.
Enable JavaScript for citation tools and additional paper interactions.