diff -r eb2f9d453070 -r 1c978b5bcc65 doc/min_cost_flow.dox
--- a/doc/min_cost_flow.dox	Sat Mar 16 14:11:32 2013 +0100
+++ b/doc/min_cost_flow.dox	Mon Mar 18 17:41:19 2013 +0100
@@ -26,7 +26,7 @@
 The \e minimum \e cost \e flow \e problem is to find a feasible flow of
 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$,
 \f$upper: A\rightarrow\mathbf{R}\cup\{+\infty\}\f$ denote the lower and