COIN-OR::LEMON - Graph Library

Changeset 771:8452ca46e29a in lemon-1.2 for lemon/hartmann_orlin.h


Ignore:
Timestamp:
10/15/09 12:55:41 (10 years ago)
Author:
Peter Kovacs <kpeter@…>
Branch:
default
Phase:
public
Message:

Add citations to the min mean cycle classes (#179, #184)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/hartmann_orlin.h

    r769 r771  
    9898  ///
    9999  /// This class implements the Hartmann-Orlin algorithm for finding
    100   /// a directed cycle of minimum mean length (cost) in a digraph.
     100  /// a directed cycle of minimum mean length (cost) in a digraph
     101  /// \ref amo93networkflows, \ref dasdan98minmeancycle.
    101102  /// It is an improved version of \ref Karp "Karp"'s original algorithm,
    102103  /// it applies an efficient early termination scheme.
Note: See TracChangeset for help on using the changeset viewer.