Changeset 771:8452ca46e29a in lemon-1.2 for doc/groups.dox

Ignore:
Timestamp:
10/15/09 12:55:41 (10 years ago)
Branch:
default
Phase:
public
Message:

Add citations to the min mean cycle classes (#179, #184)

File:
1 edited

Unmodified
Removed
• doc/groups.dox

 r770 \brief Algorithms for finding minimum mean cycles. This group contains the algorithms for finding minimum mean cycles. This group contains the algorithms for finding minimum mean cycles \ref clrs01algorithms, \ref amo93networkflows. The \e minimum \e mean \e cycle \e problem is to find a directed cycle LEMON contains three algorithms for solving the minimum mean cycle problem: - \ref Karp "Karp"'s original algorithm. - \ref Karp "Karp"'s original algorithm \ref amo93networkflows, \ref dasdan98minmeancycle. - \ref HartmannOrlin "Hartmann-Orlin"'s algorithm, which is an improved version of Karp's algorithm. - \ref Howard "Howard"'s policy iteration algorithm. version of Karp's algorithm \ref dasdan98minmeancycle. - \ref Howard "Howard"'s policy iteration algorithm \ref dasdan98minmeancycle. In practice, the Howard algorithm proved to be by far the most efficient
Note: See TracChangeset for help on using the changeset viewer.