Minimum Cost Flow Task

From GM-RKB
Jump to navigation Jump to search

A Minimum Cost Flow Task is a minimization task that minimizes flow through a Flow Network.



References

2014

  • (Wikipedia, 2014) ⇒ http://en.wikipedia.org/wiki/Minimum-cost_flow_problem Retrieved:2014-8-22.
    • The minimum-cost flow problem is to find the cheapest possible way of sending a certain amount of flow through a flow network. Solving this problem is useful for real-life situations involving networks with costs associated (e.g. telecommunications networks), as well as in other situations where the analogy is not so obvious, such as where to locate warehouses.