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)

Related topics

Related topics

33 relations
AlgorithmAndrew V. GoldbergApproximate max-flow min-cut theoremBarrier resilience

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Two-unicast is hard
Consider the k-unicast network coding problem over an acyclic wireline network: Given a rate vector k-tuple, determine whether… 
2013
2013
Flexibility and consistency in inventory-routing
In many contexts, logistics is used to enable competitive advantages and cost savings. For some companies, logistics itself is… 
Highly Cited
2009
Highly Cited
2009
Real-Time Dense and Accurate Parallel Optical Flow using CUDA
ABSTRACTA large number of processes in computer vision are based on the image motion measurement, which is the projection of… 
2008
2008
Tracking hidden agents through shadow information spaces
This paper addresses problems of inferring the locations of moving agents from combinatorial data extracted by robots that carry… 
2006
2006
Fish Passage Through Road Culverts
GARDNER, ANGELA NICHOLE. Fish Passage through Road Culverts. (Under the direction of Dr. Greg Jennings). The North Carolina… 
2005
2005
Optimizing IP Networks for Uncertain Demands Using Outbound Traffic Constraints
Conventional routing management approaches, which are based on given and often ”worst case” traffic matrices, are not sufficient… 
1995
1995
Simulation Analysis of Route Diversion Strategies for Freeway Incident Management: Final Report
Freeway incident management has become an important issue in departments of transportation nationwide. With many of the nation's… 
1993
1993
Minimax Resource Allocation Problems with Resource-Substitutions Represented by Graphs
Resource allocation problems focus on the allocation of limited resources among competing activities. We examine such problems… 
1992
1992
An auction/sequential shortest path algorithm for the minimum cost network flow problem
We propose a new algorithm for the solution of the linear minimum cost network flow problem, based on a sequential shortest path… 
Review
1991
Review
1991
Improved Diagnosability Algorithms
The concepts of the PMC and BGM self-diagnosing system models of F. P. Preparata et al. (1967) and F. Barsi et al. (1976… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)