COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
11/12/09 23:52:51 (10 years ago)
Author:
Peter Kovacs <kpeter@…>
Branch:
default
Phase:
public
Rebase:
65336539373836373466333030303164666633626635373132396336363436646237366435313232
Message:

Add citations to the scaling MCF algorithms (#180, #184)
and improve the doc of their group.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/capacity_scaling.h

    r878 r879  
    6767  /// \ref CapacityScaling implements the capacity scaling version
    6868  /// of the successive shortest path algorithm for finding a
    69   /// \ref min_cost_flow "minimum cost flow". It is an efficient dual
     69  /// \ref min_cost_flow "minimum cost flow" \ref amo93networkflows,
     70  /// \ref edmondskarp72theoretical. It is an efficient dual
    7071  /// solution method.
    7172  ///
Note: See TracChangeset for help on using the changeset viewer.