COIN-OR::LEMON - Graph Library

Changeset 771:8452ca46e29a in lemon-main for lemon/howard.h


Ignore:
Timestamp:
10/15/09 12:55:41 (15 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/howard.h

    r769 r771  
    9898  ///
    9999  /// This class implements Howard's policy iteration 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  /// This class provides the most efficient algorithm for the
    102103  /// minimum mean cycle problem, though the best known theoretical
Note: See TracChangeset for help on using the changeset viewer.