COIN-OR::LEMON - Graph Library

Changeset 816:277ef0218f0c in lemon-1.2 for lemon


Ignore:
Timestamp:
11/13/09 00:11:11 (10 years ago)
Author:
Peter Kovacs <kpeter@…>
Branch:
default
Phase:
public
Rebase:
38623133333537653838386530613132643333663761303537636464353864306537613239336461
Message:

Add citations to CycleCanceling? (#180, #184)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/cycle_canceling.h

    r815 r816  
    4646  ///
    4747  /// \ref CycleCanceling implements three different cycle-canceling
    48   /// algorithms for finding a \ref min_cost_flow "minimum cost flow".
     48  /// algorithms for finding a \ref min_cost_flow "minimum cost flow"
     49  /// \ref amo93networkflows, \ref klein67primal,
     50  /// \ref goldberg89cyclecanceling.
    4951  /// The most efficent one (both theoretically and practically)
    5052  /// is the \ref CANCEL_AND_TIGHTEN "Cancel and Tighten" algorithm,
     
    125127      SIMPLE_CYCLE_CANCELING,
    126128      /// The "Minimum Mean Cycle-Canceling" algorithm, which is a
    127       /// well-known strongly polynomial method. It improves along a
     129      /// well-known strongly polynomial method
     130      /// \ref goldberg89cyclecanceling. It improves along a
    128131      /// \ref min_mean_cycle "minimum mean cycle" in each iteration.
    129132      /// Its running time complexity is O(n<sup>2</sup>m<sup>3</sup>log(n)).
    130133      MINIMUM_MEAN_CYCLE_CANCELING,
    131134      /// The "Cancel And Tighten" algorithm, which can be viewed as an
    132       /// improved version of the previous method.
     135      /// improved version of the previous method
     136      /// \ref goldberg89cyclecanceling.
    133137      /// It is faster both in theory and in practice, its running time
    134138      /// complexity is O(n<sup>2</sup>m<sup>2</sup>log(n)).
Note: See TracChangeset for help on using the changeset viewer.