Live briefing
Everything about Minimum-cost flow problem
Mathematical optimization 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 a flow network. A typical application of this problem involves finding the best delivery route from a factory to a warehouse where the road network has some capacity and cost associated. The minimum cost flow problem is one of the most fundamental among all flow and circulation problems because most other such problems can be cast as a minimum cost flow problem and also that it can be solved efficiently using the network simplex algorithm. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Minimum-cost flow problemA 5-minute orientation
- Skim a recent paper: A survey on exact algorithms for the maximum flow and minimum‐cost flow problemsInfluential work since 2022
- Pick up a classic book: The personal MBAThe most-reprinted book on the subject
- Read the landmark paper: Nonlinear fixed charge transportation problem by minimum cost flow-based genetic algorithmCited 64 times
- Go sideways: Maximum flow problemA closely related topic
- Go sideways: Network simplex algorithmA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Nonlinear fixed charge transportation problem by minimum cost flow-based genetic algorithm
A two-phase algorithm for the biobjective integer minimum cost flow problem
Algorithms for the single-source uncapacitated minimum concave-cost network flow problem
An algorithm for the biobjective integer minimum cost flow problem
A Lagrangean heuristic for the capacitated concave minimum cost network flow problem
Time-varying minimum cost flow problems
The biobjective minimum cost flow problem
Uncertain minimum cost flow problem
🆕 Influential since 2022
A survey on exact algorithms for the maximum flow and minimum‐cost flow problems
Robust Minimum-Cost Flow Problems Under Multiple Ripple Effect Disruptions
Joint chance-constrained multi-objective multi-commodity minimum cost network flow problem with copula theory
Interactive fuzzy goal programming approach for solving possibilistic multi-objective minimum cost flow problems
The Minimum‐Cost Dynamic Flow Problem in a Fixed Graph With a Constant Target Flow Value
📚 Books worth reading
The personal MBAJosh Kaufman · 2010
Data structures and algorithm analysis in CMark Allen Weiss · 1993
The Conspirators HierarchyJohn Coleman · 1992
Treaty Occupationay ToxicologySuelen Queiroz · 2010
Data structures & algorithm analysis in JavaMark Allen Weiss · 1999- 📕Vehicle Scheduling in Port AutomationEdward Tsang, Hassan Rashidi · 2015
Accounting handbookJoel G. Siegel, Jae K. Shim Ph.D · 1990
Computer algorithmsEllis Horowitz · 1997
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Maximum flow problem In optimization theory, maximum flow problems involve finding a feasible flow through a flow network that obtains the maximum possible flow rate. The maximum…
- Network simplex algorithm In mathematical optimization, the network simplex algorithm is a graph theoretic specialization of the simplex algorithm. The algorithm is usually formulated…
- Assignment problem The assignment problem is a fundamental combinatorial optimization problem. In its most general form, the problem is as follows: The problem instance has…
- 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…
- 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…
- Maximum-cardinality matching In graph theory, a maximum-cardinality matching is a special kind of subgraph useful in many computational contexts. Given a graph G, a matching is a subgraph…
- 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…
- Matching (graph theory) In the mathematical discipline of graph theory, a matching or independent edge set in an undirected graph is a set of edges without common vertices. In…