1.1 --- a/doc/min_cost_flow.dox Sat Mar 16 14:11:32 2013 +0100
1.2 +++ b/doc/min_cost_flow.dox Mon Mar 18 17:41:19 2013 +0100
1.3 @@ -26,7 +26,7 @@
1.4 The \e minimum \e cost \e flow \e problem is to find a feasible flow of
1.5 minimum total cost from a set of supply nodes to a set of demand nodes
1.6 in a network with capacity constraints (lower and upper bounds)
1.7 -and arc costs \ref amo93networkflows.
1.8 +and arc costs \cite amo93networkflows.
1.9
1.10 Formally, let \f$G=(V,A)\f$ be a digraph, \f$lower: A\rightarrow\mathbf{R}\f$,
1.11 \f$upper: A\rightarrow\mathbf{R}\cup\{+\infty\}\f$ denote the lower and