Skip to search formSkip to main contentSkip to account menu

Maximum flow problem

Known as: Max flow problem, Max flow, Maximum flow 
In optimization theory, maximum flow problems involve finding a feasible flow through a single-source, single-sink flow network that is maximum. The… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
With consideration of the intermittency of renewable generation and uncertain load, a regional control strategy is presented to… 
2014
2014
Consider the k-unicast network coding problem over an acyclic wireline network: Given a rate vector k-tuple, determine whether… 
2013
2013
In many contexts, logistics is used to enable competitive advantages and cost savings. For some companies, logistics itself is… 
2008
2008
This paper addresses problems of inferring the locations of moving agents from combinatorial data extracted by robots that carry… 
2006
2006
GARDNER, ANGELA NICHOLE. Fish Passage through Road Culverts. (Under the direction of Dr. Greg Jennings). The North Carolina… 
2004
2004
Upper and lower bounds on the capacity and minimum energy-per-bit for general additive white Gaussian noise (AWGN) and frequency… 
1995
1995
Freeway incident management has become an important issue in departments of transportation nationwide. With many of the nation's… 
1993
1993
Resource allocation problems focus on the allocation of limited resources among competing activities. We examine such problems… 
1992
1992
We propose a new algorithm for the solution of the linear minimum cost network flow problem, based on a sequential shortest path… 
1989
1989
The problem in the above paper (see ibid., vol.COM-35, p.755-61, July 1987) is formulated in terms of a max-flow network problem…