Changeset 835:c92296660262 in lemon for doc/min_cost_flow.dox
 Timestamp:
 11/18/09 14:38:02 (11 years ago)
 Branch:
 default
 Parents:
 834:c2230649a493 (diff), 833:e20173729589 (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the (diff) links above to see all the changes relative to each parent.  Phase:
 public
 Files:

 2 edited
Legend:
 Unmodified
 Added
 Removed

doc/min_cost_flow.dox
r833 r835 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$, 
doc/min_cost_flow.dox
r802 r835 79 79  if \f$cost^\pi(uv)<0\f$, then \f$f(uv)=upper(uv)\f$. 80 80  For all \f$u\in V\f$ nodes: 81  \f$\pi(u) <=0\f$;81  \f$\pi(u)\leq 0\f$; 82 82  if \f$\sum_{uv\in A} f(uv)  \sum_{vu\in A} f(vu) \neq sup(u)\f$, 83 83 then \f$\pi(u)=0\f$. … … 146 146  if \f$cost^\pi(uv)<0\f$, then \f$f(uv)=upper(uv)\f$. 147 147  For all \f$u\in V\f$ nodes: 148  \f$\pi(u) >=0\f$;148  \f$\pi(u)\geq 0\f$; 149 149  if \f$\sum_{uv\in A} f(uv)  \sum_{vu\in A} f(vu) \neq sup(u)\f$, 150 150 then \f$\pi(u)=0\f$.
Note: See TracChangeset
for help on using the changeset viewer.