Changeset 1053:1c978b5bcc65 in lemon-main for doc/min_cost_flow.dox

Timestamp:

03/18/13 17:41:19 (12 years ago)

Author:

Alpar Juttner <alpar@…>

Branch:

default

Phase:

public

Message:

Use doxygen's own bibtex support (#456)

File:

• doc/min_cost_flow.dox (modified) (1 diff)

doc/min_cost_flow.dox

@@ -27 +27 @@
 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$,