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.
Nº Q2897180 ★
Common · Knowledge
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.
From Wikipedia
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.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
-
Vertex-cover problem
Set of vertices incident on every edge
Nº Q924362 ★
Not listed
-
Shortest path problem
Problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized
Nº Q1058754 ★★
Not listed
-
Maximum flow problem
Computational problem in graph theory
Nº Q2585642 ★
Not listed
-
Change-making problem
The computational problem of choosing as few coins as possible that add up to a given amount of money
Nº Q3406279 ★
Not listed
-
Ford–Fulkerson algorithm
Algorithm
Nº Q284695 ★
Not listed
-
C
Computational complexity
Measure of the amount of resources needed to run an algorithm or solve a computational problem
Nº Q5157286 ★★★
Not listed