A maximum-value feasible network flow chosen to have the least total cost among all maximum-value flows. It combines a maximum-flow objective with a minimum-cost flow objective.

Ancestors (6)

  1. Minimum-cost flow problem
  2. Graph theory
  3. Foundations of mathematics
  4. Area of mathematics
  5. Mathematics
  6. Home

View article source

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version