Changeset 1221:1c978b5bcc65 in lemon for doc/groups.dox
 Timestamp:
 03/18/13 17:41:19 (7 years ago)
 Branch:
 default
 Phase:
 public
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

doc/groups.dox
r1219 r1221 318 318 This group contains the common graph search algorithms, namely 319 319 \e breadthfirst \e search (BFS) and \e depthfirst \e search (DFS) 320 \ refclrs01algorithms.320 \cite clrs01algorithms. 321 321 */ 322 322 … … 327 327 328 328 This group contains the algorithms for finding shortest paths in digraphs 329 \ refclrs01algorithms.329 \cite clrs01algorithms. 330 330 331 331  \ref Dijkstra algorithm for finding shortest paths from a source node … … 349 349 350 350 This group contains the algorithms for finding minimum cost spanning 351 trees and arborescences \ refclrs01algorithms.351 trees and arborescences \cite clrs01algorithms. 352 352 */ 353 353 … … 358 358 359 359 This group contains the algorithms for finding maximum flows and 360 feasible circulations \ ref clrs01algorithms, \refamo93networkflows.360 feasible circulations \cite clrs01algorithms, \cite amo93networkflows. 361 361 362 362 The \e maximum \e flow \e problem is to find a flow of maximum value between … … 374 374 LEMON contains several algorithms for solving maximum flow problems: 375 375  \ref EdmondsKarp EdmondsKarp algorithm 376 \ refedmondskarp72theoretical.376 \cite edmondskarp72theoretical. 377 377  \ref Preflow GoldbergTarjan's preflow pushrelabel algorithm 378 \ refgoldberg88newapproach.378 \cite goldberg88newapproach. 379 379  \ref DinitzSleatorTarjan Dinitz's blocking flow algorithm with dynamic trees 380 \ ref dinic70algorithm, \refsleator83dynamic.380 \cite dinic70algorithm, \cite sleator83dynamic. 381 381  \ref GoldbergTarjan !Preflow pushrelabel algorithm with dynamic trees 382 \ ref goldberg88newapproach, \refsleator83dynamic.382 \cite goldberg88newapproach, \cite sleator83dynamic. 383 383 384 384 In most cases the \ref Preflow algorithm provides the … … 400 400 401 401 This group contains the algorithms for finding minimum cost flows and 402 circulations \ refamo93networkflows. For more information about this402 circulations \cite amo93networkflows. For more information about this 403 403 problem and its dual solution, see: \ref min_cost_flow 404 404 "Minimum Cost Flow Problem". … … 406 406 LEMON contains several algorithms for this problem. 407 407  \ref NetworkSimplex Primal Network Simplex algorithm with various 408 pivot strategies \ ref dantzig63linearprog, \refkellyoneill91netsimplex.408 pivot strategies \cite dantzig63linearprog, \cite kellyoneill91netsimplex. 409 409  \ref CostScaling Cost Scaling algorithm based on push/augment and 410 relabel operations \ ref goldberg90approximation, \refgoldberg97efficient,411 \ refbunnagel98efficient.410 relabel operations \cite goldberg90approximation, \cite goldberg97efficient, 411 \cite bunnagel98efficient. 412 412  \ref CapacityScaling Capacity Scaling algorithm based on the successive 413 shortest path method \ refedmondskarp72theoretical.413 shortest path method \cite edmondskarp72theoretical. 414 414  \ref CycleCanceling CycleCanceling algorithms, two of which are 415 strongly polynomial \ ref klein67primal, \refgoldberg89cyclecanceling.415 strongly polynomial \cite klein67primal, \cite goldberg89cyclecanceling. 416 416 417 417 In general, \ref NetworkSimplex and \ref CostScaling are the most efficient … … 431 431 432 432 For more details about these implementations and for a comprehensive 433 experimental study, see the paper \ refKiralyKovacs12MCF.433 experimental study, see the paper \cite KiralyKovacs12MCF. 434 434 It also compares these codes to other publicly available 435 435 minimum cost flow solvers. … … 472 472 473 473 This group contains the algorithms for finding minimum mean cycles 474 \ ref amo93networkflows, \refkarp78characterization.474 \cite amo93networkflows, \cite karp78characterization. 475 475 476 476 The \e minimum \e mean \e cycle \e problem is to find a directed cycle … … 488 488 489 489 LEMON contains three algorithms for solving the minimum mean cycle problem: 490  \ref KarpMmc Karp's original algorithm \ refkarp78characterization.490  \ref KarpMmc Karp's original algorithm \cite karp78characterization. 491 491  \ref HartmannOrlinMmc HartmannOrlin's algorithm, which is an improved 492 version of Karp's algorithm \ refhartmann93finding.492 version of Karp's algorithm \cite hartmann93finding. 493 493  \ref HowardMmc Howard's policy iteration algorithm 494 \ ref dasdan98minmeancycle, \refdasdan04experimental.494 \cite dasdan98minmeancycle, \cite dasdan04experimental. 495 495 496 496 In practice, the \ref HowardMmc "Howard" algorithm turned out to be by far the … … 648 648 highlevel interface. 649 649 650 The currently supported solvers are \ ref glpk, \ref clp, \refcbc,651 \ ref cplex, \refsoplex.650 The currently supported solvers are \cite glpk, \cite clp, \cite cbc, 651 \cite cplex, \cite soplex. 652 652 */ 653 653
Note: See TracChangeset
for help on using the changeset viewer.