Changes in doc/min_cost_flow.dox [786:e20173729589:788:c92296660262] in lemon-main
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
doc/min_cost_flow.dox
r786 r788 27 27 minimum total cost from a set of supply nodes to a set of demand nodes 28 28 in a network with capacity constraints (lower and upper bounds) 29 and arc costs .29 and arc costs \ref amo93networkflows. 30 30 31 31 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.