# Changes in doc/min_cost_flow.dox[1164:f63ba40a60f4:1221:1c978b5bcc65] in lemon

Ignore:
File:
1 edited

Unmodified
Added
Removed
• ## doc/min_cost_flow.dox

 r1164 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 \ref amo93networkflows. and arc costs \cite amo93networkflows. Formally, let \f$G=(V,A)\f$ be a digraph, \f$lower: A\rightarrow\mathbf{R}\f$,
Note: See TracChangeset for help on using the changeset viewer.