Changes in doc/min_cost_flow.dox [802:134852d7fb0a:710:8b0df68370a4] in lemon
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
doc/min_cost_flow.dox
r802 r710 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 \ref amo93networkflows.29 and arc costs. 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.