Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,206,644 papers from all fields of science
Search
Sign In
Create Free Account
Maximum flow problem
Known as:
Max flow problem
, Max flow
, Maximum flow
Expand
In optimization theory, maximum flow problems involve finding a feasible flow through a single-source, single-sink flow network that is maximum. The…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
33 relations
Algorithm
Andrew V. Goldberg
Approximate max-flow min-cut theorem
Barrier resilience
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Two-unicast is hard
Sudeep Kamath
,
David Tse
,
Chih-Chun Wang
IEEE International Symposium on Information…
2014
Corpus ID: 12584188
Consider the k-unicast network coding problem over an acyclic wireline network: Given a rate vector k-tuple, determine whether…
Expand
2013
2013
Flexibility and consistency in inventory-routing
Leandro C. Coelho
4OR
2013
Corpus ID: 44918855
In many contexts, logistics is used to enable competitive advantages and cost savings. For some companies, logistics itself is…
Expand
2008
2008
Tracking hidden agents through shadow information spaces
Jingjin Yu
,
S. LaValle
IEEE International Conference on Robotics and…
2008
Corpus ID: 15805033
This paper addresses problems of inferring the locations of moving agents from combinatorial data extracted by robots that carry…
Expand
2007
2007
Progress with Particle Flow Calorimetry
M. Thomson
2007
Corpus ID: 118625896
One of the most important requirements for a detector at the ILC is good jet energy resolution. It is widely believed that the…
Expand
2004
2004
An integral flow-based energy-efficient routing algorithm for wireless sensor networks
S. Gandham
,
Milind Dawande
,
R. Prakash
IEEE Wireless Communications and Networking…
2004
Corpus ID: 5609126
Sensor networks consist of a large number of sensor nodes performing distributed sensing and event detection. As sensor nodes are…
Expand
2004
2004
A Multi-Scale Geometric Flow for Seg- menting Vasculature in MRI: Theory and Validation
M. Descoteaux
2004
Corpus ID: 117007631
Often in neurosurgical planning a dual echo acquisition is performed that yields proton density (PD) and T2-weighted images to…
Expand
1993
1993
Minimax Resource Allocation Problems with Resource-Substitutions Represented by Graphs
Rachelle S. Klein
,
Hanan Luss
,
U. Rothblum
Operational Research
1993
Corpus ID: 42856517
Resource allocation problems focus on the allocation of limited resources among competing activities. We examine such problems…
Expand
1992
1992
An auction/sequential shortest path algorithm for the minimum cost network flow problem
D. Bertsekas
,
Decision Systems.
1992
Corpus ID: 16620572
We propose a new algorithm for the solution of the linear minimum cost network flow problem, based on a sequential shortest path…
Expand
1991
1991
On the LP which finds a MMAE stack filter
M. Gabbouj
,
E. Coyle
IEEE Transactions on Signal Processing
1991
Corpus ID: 13429865
Two methods are proposed to modify the linear program (LP) developed by E.J. Coyle and J.-H. Lin (1988) to find a stack filter…
Expand
1989
1989
Comments on 'Fundamental conditions governing TDM switching assignments in terrestrial and satellite networks' [by K.Y. Eng and A.S. Acampora]
S. Liew
IEEE Transactions on Communications
1989
Corpus ID: 41760849
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…
Expand