1.1 --- a/lemon/network_simplex.h	Mon Sep 28 15:53:20 2009 +0200
     1.2 +++ b/lemon/network_simplex.h	Thu Nov 05 10:27:17 2009 +0100
     1.3 @@ -40,7 +40,9 @@
     1.4    /// for finding a \ref min_cost_flow "minimum cost flow".
     1.5    ///
     1.6    /// \ref NetworkSimplex implements the primal Network Simplex algorithm
     1.7 -  /// for finding a \ref min_cost_flow "minimum cost flow".
     1.8 +  /// for finding a \ref min_cost_flow "minimum cost flow"
     1.9 +  /// \ref amo93networkflows, \ref dantzig63linearprog,
    1.10 +  /// \ref kellyoneill91netsimplex.
    1.11    /// This algorithm is a specialized version of the linear programming
    1.12    /// simplex method directly for the minimum cost flow problem.
    1.13    /// It is one of the most efficient solution methods.