Example: confidence

Minimum Cost Flow - Columbia University

Minimum Cost Flow Notations: Directed graph G= (V;E) Let u denote capacities Let c denote edge costs. A ow of f(v;w) units on edge (v;w) contributes cost c(v;w)f(v;w) to the objective function. Di erent (equivalent) formulations Find the maximum ow of minimum cost. Send x units of ow from s to t as cheaply as possible.

Tags:

  University, Cost, Flows, Minimum, Columbia university, Columbia, Minimum cost flow, Minimum cost

Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Related search queries