COIN-OR::LEMON - Graph Library

Changeset 818:8452ca46e29a in lemon for doc


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
  • doc/groups.dox

    r817 r818  
    458458\brief Algorithms for finding minimum mean cycles.
    459459
    460 This group contains the algorithms for finding minimum mean cycles.
     460This group contains the algorithms for finding minimum mean cycles
     461\ref clrs01algorithms, \ref amo93networkflows.
    461462
    462463The \e minimum \e mean \e cycle \e problem is to find a directed cycle
     
    474475
    475476LEMON contains three algorithms for solving the minimum mean cycle problem:
    476 - \ref Karp "Karp"'s original algorithm.
     477- \ref Karp "Karp"'s original algorithm \ref amo93networkflows,
     478  \ref dasdan98minmeancycle.
    477479- \ref HartmannOrlin "Hartmann-Orlin"'s algorithm, which is an improved
    478   version of Karp's algorithm.
    479 - \ref Howard "Howard"'s policy iteration algorithm.
     480  version of Karp's algorithm \ref dasdan98minmeancycle.
     481- \ref Howard "Howard"'s policy iteration algorithm
     482  \ref dasdan98minmeancycle.
    480483
    481484In practice, the Howard algorithm proved to be by far the most efficient
Note: See TracChangeset for help on using the changeset viewer.