Minimum Cost Network Flow Problem
Jump to navigation
Jump to search
Description
The objective in most network flow problems is to minimize the total cost, distance, or penalty that must be incurred to solve the problem. Such problems are known as minimum cost network flow problems.
Concept Prerequisite
Wikipedia Reference
http://en.wikipedia.org/wiki/Minimum-cost flow problem
Learning Material
Covered in Topic(s)
| Network Flow Models |