Changeset 755:134852d7fb0a in lemon-1.2 for doc/min_cost_flow.dox

Timestamp:

10/10/09 08:18:46 (15 years ago)

Author:

Peter Kovacs <kpeter@…>

Branch:

default

Phase:

public

Message:

Insert citations into the doc (#184)

• Add general citations to modules.
• Add specific citations for max flow and min cost flow algorithms.
• Add citations for the supported LP and MIP solvers.
• Extend the main page.
• Replace inproceedings entries with the journal versions.
• Add a new bibtex entry about network simplex.
• Remove unwanted entries.

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.
+and arc costs \ref amo93networkflows.
 
 Formally, let \f$G=(V,A)\f$ be a digraph, \f$lower: A\rightarrow\mathbf{R}\f$,