COIN-OR::LEMON - Graph Library

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


Ignore:
Timestamp:
03/18/13 17:41:19 (8 years ago)
Author:
Alpar Juttner <alpar@…>
Branch:
default
Phase:
public
Message:

Use doxygen's own bibtex support (#456)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • doc/min_cost_flow.dox

    r1002 r1053  
    2727minimum total cost from a set of supply nodes to a set of demand nodes
    2828in a network with capacity constraints (lower and upper bounds)
    29 and arc costs \ref amo93networkflows.
     29and arc costs \cite amo93networkflows.
    3030
    3131Formally, let \f$G=(V,A)\f$ be a digraph, \f$lower: A\rightarrow\mathbf{R}\f$,
Note: See TracChangeset for help on using the changeset viewer.