1.1 --- a/lemon/hartmann_orlin_mmc.h	Sat Mar 16 14:11:32 2013 +0100
     1.2 +++ b/lemon/hartmann_orlin_mmc.h	Mon Mar 18 17:41:19 2013 +0100
     1.3 @@ -98,7 +98,7 @@
     1.4    ///
     1.5    /// This class implements the Hartmann-Orlin algorithm for finding
     1.6    /// a directed cycle of minimum mean cost in a digraph
     1.7 -  /// \ref hartmann93finding, \ref dasdan98minmeancycle.
     1.8 +  /// \cite hartmann93finding, \cite dasdan98minmeancycle.
     1.9    /// This method is based on \ref KarpMmc "Karp"'s original algorithm, but
    1.10    /// applies an early termination scheme. It makes the algorithm
    1.11    /// significantly faster for some problem instances, but slower for others.