# Changeset 884:3ed8f7c8bed8 in lemon-1.2

Ignore:
Timestamp:
03/18/10 14:50:32 (11 years ago)
Branch:
1.2
Parents:
882:7af2ae7c1428 (diff), 883:87569cb5734d (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the (diff) links above to see all the changes relative to each parent.
Phase:
public
Tags:
r1.2
Message:

Merge #341, #360, #51, #359 to branch 1.2

Files:
2 edited

Unmodified
Removed
• ## doc/groups.dox

 r882 /** @defgroup matrices Matrices @ingroup datas \brief Two dimensional data storages implemented in LEMON. This group contains two dimensional data storages implemented in LEMON. */ /** @defgroup auxdat Auxiliary Data Structures @ingroup datas LEMON contains three algorithms for solving the minimum mean cycle problem: - \ref Karp "Karp"'s original algorithm \ref amo93networkflows, - \ref KarpMmc Karp's original algorithm \ref amo93networkflows, \ref dasdan98minmeancycle. - \ref HartmannOrlin "Hartmann-Orlin"'s algorithm, which is an improved - \ref HartmannOrlinMmc Hartmann-Orlin's algorithm, which is an improved version of Karp's algorithm \ref dasdan98minmeancycle. - \ref Howard "Howard"'s policy iteration algorithm - \ref HowardMmc Howard's policy iteration algorithm \ref dasdan98minmeancycle. In practice, the Howard algorithm proved to be by far the most efficient one, though the best known theoretical bound on its running time is exponential. Both Karp and HartmannOrlin algorithms run in time O(ne) and use space O(n2+e), but the latter one is typically faster due to the applied early termination scheme. In practice, the \ref HowardMmc "Howard" algorithm proved to be by far the most efficient one, though the best known theoretical bound on its running time is exponential. Both \ref KarpMmc "Karp" and \ref HartmannOrlinMmc "Hartmann-Orlin" algorithms run in time O(ne) and use space O(n2+e), but the latter one is typically faster due to the applied early termination scheme. */
• ## doc/groups.dox

 r880 /** @defgroup matrices Matrices @ingroup auxdat \brief Two dimensional data storages implemented in LEMON. This group contains two dimensional data storages implemented in LEMON. */ /** @defgroup algs Algorithms \brief This group contains the several algorithms but the digraph should not contain directed cycles with negative total length. - \ref FloydWarshall "Floyd-Warshall" and \ref Johnson "Johnson" algorithms for solving the \e all-pairs \e shortest \e paths \e problem when arc lenghts can be either positive or negative, but the digraph should not contain directed cycles with negative total length. - \ref Suurballe A successive shortest path algorithm for finding arc-disjoint paths between two nodes having minimum total length. \f[ 0 \leq f(uv) \leq cap(uv) \quad \forall uv\in A \f] LEMON contains several algorithms for solving maximum flow problems: - \ref EdmondsKarp Edmonds-Karp algorithm \ref edmondskarp72theoretical. - \ref Preflow Goldberg-Tarjan's preflow push-relabel algorithm \ref goldberg88newapproach. - \ref DinitzSleatorTarjan Dinitz's blocking flow algorithm with dynamic trees \ref dinic70algorithm, \ref sleator83dynamic. - \ref GoldbergTarjan !Preflow push-relabel algorithm with dynamic trees \ref goldberg88newapproach, \ref sleator83dynamic. In most cases the \ref Preflow algorithm provides the fastest method for computing a maximum flow. All implementations also provide functions to query the minimum cut, which is the dual problem of maximum flow. \ref Preflow is an efficient implementation of Goldberg-Tarjan's preflow push-relabel algorithm \ref goldberg88newapproach for finding maximum flows. It also provides functions to query the minimum cut, which is the dual problem of maximum flow. \ref Circulation is a preflow push-relabel algorithm implemented directly - \ref HaoOrlin "Hao-Orlin algorithm" for calculating minimum cut in directed graphs. - \ref NagamochiIbaraki "Nagamochi-Ibaraki algorithm" for calculating minimum cut in undirected graphs. - \ref GomoryHu "Gomory-Hu tree computation" for calculating all-pairs minimum cut in undirected graphs. The matching algorithms implemented in LEMON: - \ref MaxBipartiteMatching Hopcroft-Karp augmenting path algorithm for calculating maximum cardinality matching in bipartite graphs. - \ref PrBipartiteMatching Push-relabel algorithm for calculating maximum cardinality matching in bipartite graphs. - \ref MaxWeightedBipartiteMatching Successive shortest path algorithm for calculating maximum weighted matching and maximum weighted bipartite matching in bipartite graphs. - \ref MinCostMaxBipartiteMatching Successive shortest path algorithm for calculating minimum cost maximum matching in bipartite graphs. - \ref MaxMatching Edmond's blossom shrinking algorithm for calculating maximum cardinality matching in general graphs. /** @defgroup approx Approximation Algorithms @ingroup algs \brief Approximation algorithms. This group contains the approximation and heuristic algorithms implemented in LEMON. */ /** @defgroup auxalg Auxiliary Algorithms @ingroup algs The currently supported solvers are \ref glpk, \ref clp, \ref cbc, \ref cplex, \ref soplex. */ /** @defgroup lp_utils Tools for Lp and Mip Solvers @ingroup lp_group \brief Helper tools to the Lp and Mip solvers. This group adds some helper tools to general optimization framework implemented in LEMON. */ /** @defgroup metah Metaheuristics @ingroup gen_opt_group \brief Metaheuristics for LEMON library. This group contains some metaheuristic optimization tools. */
Note: See TracChangeset for help on using the changeset viewer.