# Changes in doc/min_cost_flow.dox[710:8b0df68370a4:802:134852d7fb0a] in lemon

Ignore:
File:
1 edited

### Legend:

Unmodified
 r710 minimum total cost from a set of supply nodes to a set of demand nodes in a network with capacity constraints (lower and upper bounds) and arc costs. and arc costs \ref amo93networkflows. Formally, let \f$G=(V,A)\f$ be a digraph, \f$lower: A\rightarrow\mathbf{R}\f$,