Live briefing
Everything about Maximum flow problem
Computational problem in graph theory
In optimization theory, maximum flow problems involve finding a feasible flow through a flow network that obtains the maximum possible flow rate. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Maximum flow problemA 5-minute orientation
- Skim a recent paper: Distributed no-wait flow shop problem with sequence dependent setup time: Optimization of makespan and maximum tardinessInfluential work since 2022
- Pick up a classic book: Computer NetworksThe most-reprinted book on the subject
- Read the landmark paper: A new approach to the maximum-flow problemCited 1,386 times
- Go sideways: Minimum-cost flow problemA closely related topic
- Go sideways: Flow networkA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
A new approach to the maximum-flow problem
The maximum concurrent flow problem
Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem
The maximum flow problem is log space complete for P
Improved Time Bounds for the Maximum Flow Problem
A Fast and Simple Algorithm for the Maximum Flow Problem
The maximum flow problem of uncertain network
The maximum flow problem with disjunctive constraints
🆕 Influential since 2022
Distributed no-wait flow shop problem with sequence dependent setup time: Optimization of makespan and maximum tardiness
Enhanced instance space analysis for the maximum flow problem
Hybridizing Carousel Greedy and Kernel Search: A new approach for the maximum flow problem with conflict constraints
Machine learning based approaches to solve the maximum flow network interdiction problem
Mixed-integer programming models and heuristic algorithms for the maximum value dynamic network flow scheduling problem
đź“š Books worth reading
Computer NetworksAndrew S. Tanenbaum, John David Wetherall · 1981
Bioinformatics Research and ApplicationsZhipeng Cai · 2013
Mathematical Methods in the Physical SciencesMary L. Boas, Mary Layne Boas · 1966
Data structures and algorithm analysis in CMark Allen Weiss · 1993
Discrete mathematicsNorman Biggs · 1985
Data structures & algorithm analysis in JavaMark Allen Weiss · 1999
Data science from scratchJoel Grus · 2015
TCP/IP IllustratedW. Richard Stevens, Kevin R. Fall · 1993
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Minimum-cost flow problem The minimum-cost flow problem (MCFP) is an optimization and decision problem to find the cheapest possible way of sending a certain amount of flow through…
- Flow network In graph theory, a flow network or a transportation network is a directed graph where each edge has a capacity and each edge receives a flow. The amount…
- Edmonds–Karp algorithm In computer science, the Edmonds–Karp algorithm is an implementation of the Ford–Fulkerson method for computing the maximum flow in a flow network in O(|V||E|2)…
- Suurballe's algorithm In theoretical computer science and network routing, Suurballe's algorithm is an algorithm for finding two disjoint paths in a nonnegatively-weighted directed…
- Ford–Fulkerson algorithm The Ford–Fulkerson method or Ford–Fulkerson algorithm (FFA) is a greedy algorithm that computes the maximum flow in a flow network. It is sometimes called…
- Max-flow min-cut theorem In computer science and optimization theory, the max-flow min-cut theorem states that in a flow network, the maximum amount of flow passing from the source…
- Cut (graph theory) In graph theory, a cut is a partition of the vertices of a graph into two disjoint subsets. Any cut determines a cut-set, the set of edges that have one…
- Minimum cut In graph theory, a minimum cut or min-cut of a graph is a cut (a partition of the vertices of a graph into two disjoint subsets) that is minimal in some…