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

Ignore:
Timestamp:
10/10/09 08:18:46 (11 years ago)
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.
 r663 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$,