# Changeset 1221:1c978b5bcc65 in lemon

Ignore:
Timestamp:
03/18/13 17:41:19 (7 years ago)
Branch:
default
Phase:
public
Message:

Use doxygen's own bibtex support (#456)

Files:
1 deleted
14 edited

Unmodified
Removed

• ## lemon/cost_scaling.h

 r1217 /// \ref CostScaling implements a cost scaling algorithm that performs /// push/augment and relabel operations for finding a \ref min_cost_flow /// "minimum cost flow" \ref amo93networkflows, \ref goldberg90approximation, /// \ref goldberg97efficient, \ref bunnagel98efficient. /// "minimum cost flow" \cite amo93networkflows, \cite goldberg90approximation, /// \cite goldberg97efficient, \cite bunnagel98efficient. /// It is a highly efficient primal-dual solution method, which /// can be viewed as the generalization of the \ref Preflow
• ## lemon/cycle_canceling.h

 r1217 /// \ref CycleCanceling implements three different cycle-canceling /// algorithms for finding a \ref min_cost_flow "minimum cost flow" /// \ref amo93networkflows, \ref klein67primal, /// \ref goldberg89cyclecanceling. /// \cite amo93networkflows, \cite klein67primal, /// \cite goldberg89cyclecanceling. /// The most efficent one is the \ref CANCEL_AND_TIGHTEN /// "Cancel-and-Tighten" algorithm, thus it is the default method. /// The "Minimum Mean Cycle-Canceling" algorithm, which is a /// well-known strongly polynomial method /// \ref goldberg89cyclecanceling. It improves along a /// \cite goldberg89cyclecanceling. It improves along a /// \ref min_mean_cycle "minimum mean cycle" in each iteration. /// Its running time complexity is O(n2e3log(n)). /// The "Cancel-and-Tighten" algorithm, which can be viewed as an /// improved version of the previous method /// \ref goldberg89cyclecanceling. /// \cite goldberg89cyclecanceling. /// It is faster both in theory and in practice, its running time /// complexity is O(n2e2log(n)).
• ## lemon/grosso_locatelli_pullan_mc.h

 r1022 /// \ref GrossoLocatelliPullanMc implements the iterated local search /// algorithm of Grosso, Locatelli, and Pullan for solving the \e maximum /// \e clique \e problem \ref grosso08maxclique. /// \e clique \e problem \cite grosso08maxclique. /// It is to find the largest complete subgraph (\e clique) in an /// undirected graph, i.e., the largest set of nodes where each
• ## lemon/hartmann_orlin_mmc.h

 r1217 /// This class implements the Hartmann-Orlin algorithm for finding /// a directed cycle of minimum mean cost in a digraph /// \ref hartmann93finding, \ref dasdan98minmeancycle. /// \cite hartmann93finding, \cite dasdan98minmeancycle. /// This method is based on \ref KarpMmc "Karp"'s original algorithm, but /// applies an early termination scheme. It makes the algorithm
• ## lemon/howard_mmc.h

 r1217 /// This class implements Howard's policy iteration algorithm for finding /// a directed cycle of minimum mean cost in a digraph /// \ref dasdan98minmeancycle, \ref dasdan04experimental. /// \cite dasdan98minmeancycle, \cite dasdan04experimental. /// This class provides the most efficient algorithm for the /// minimum mean cycle problem, though the best known theoretical
• ## lemon/karp_mmc.h

 r1217 /// This class implements Karp's algorithm for finding a directed /// cycle of minimum mean cost in a digraph /// \ref karp78characterization, \ref dasdan98minmeancycle. /// \cite karp78characterization, \cite dasdan98minmeancycle. /// It runs in time O(ne) and uses space O(n2+e). ///
• ## lemon/network_simplex.h

 r1217 /// \ref NetworkSimplex implements the primal Network Simplex algorithm /// for finding a \ref min_cost_flow "minimum cost flow" /// \ref amo93networkflows, \ref dantzig63linearprog, /// \ref kellyoneill91netsimplex. /// \cite amo93networkflows, \cite dantzig63linearprog, /// \cite kellyoneill91netsimplex. /// This algorithm is a highly efficient specialized version of the /// linear programming simplex method directly for the minimum cost
• ## lemon/preflow.h

 r1111 /// This class provides an implementation of Goldberg-Tarjan's \e preflow /// \e push-relabel algorithm producing a \ref max_flow /// "flow of maximum value" in a digraph \ref clrs01algorithms, /// \ref amo93networkflows, \ref goldberg88newapproach. /// "flow of maximum value" in a digraph \cite clrs01algorithms, /// \cite amo93networkflows, \cite goldberg88newapproach. /// The preflow algorithms are the fastest known maximum /// flow algorithms. The current implementation uses a mixture of the
Note: See TracChangeset for help on using the changeset viewer.