Changes in / [1342:5c247b4dc708:1341:c199e9976d93] in lemon
 Files:

 1 deleted
 2 edited
Legend:
 Unmodified
 Added
 Removed

NEWS
r1320 r1281 1 20140707 Version 1.3.1 released2 3 Bugfix release.4 5 #484: Require CMAKE 2.86 #471, #472, #480: Various clang compatibility fixes7 #481, #482: Fix shared lib build and versioning8 #476: Fix invalid map query in NearestNeighborTsp9 #478: Bugfix in debug checking and lower bound handling10 in min cost flow algorithms11 #479, #465: Bugfix in default LP/MIP backend settings12 #476: Bugfix in tsp_test13 #487: Add missing include header and std:: namespace spec.14 #474: Fix division by zero error in NetworkSimplex15 16 1 20130810 Version 1.3 released 17 2 
doc/groups.dox
r1280 r1271 295 295 296 296 /** 297 @defgroup matrices Matrices 298 @ingroup auxdat 299 \brief Two dimensional data storages implemented in LEMON. 300 301 This group contains two dimensional data storages implemented in LEMON. 302 */ 303 304 /** 297 305 @defgroup algs Algorithms 298 306 \brief This group contains the several algorithms … … 327 335 but the digraph should not contain directed cycles with negative total 328 336 length. 337  \ref FloydWarshall "FloydWarshall" and \ref Johnson "Johnson" algorithms 338 for solving the \e allpairs \e shortest \e paths \e problem when arc 339 lenghts can be either positive or negative, but the digraph should 340 not contain directed cycles with negative total length. 329 341  \ref Suurballe A successive shortest path algorithm for finding 330 342 arcdisjoint paths between two nodes having minimum total length. … … 360 372 \f[ 0 \leq f(uv) \leq cap(uv) \quad \forall uv\in A \f] 361 373 362 \ref Preflow is an efficient implementation of GoldbergTarjan's 363 preflow pushrelabel algorithm \cite goldberg88newapproach for finding 364 maximum flows. It also provides functions to query the minimum cut, 365 which is the dual problem of maximum flow. 374 LEMON contains several algorithms for solving maximum flow problems: 375  \ref EdmondsKarp EdmondsKarp algorithm 376 \cite edmondskarp72theoretical. 377  \ref Preflow GoldbergTarjan's preflow pushrelabel algorithm 378 \cite goldberg88newapproach. 379  \ref DinitzSleatorTarjan Dinitz's blocking flow algorithm with dynamic trees 380 \cite dinic70algorithm, \cite sleator83dynamic. 381  \ref GoldbergTarjan !Preflow pushrelabel algorithm with dynamic trees 382 \cite goldberg88newapproach, \cite sleator83dynamic. 383 384 In most cases the \ref Preflow algorithm provides the 385 fastest method for computing a maximum flow. All implementations 386 also provide functions to query the minimum cut, which is the dual 387 problem of maximum flow. 366 388 367 389 \ref Circulation is a preflow pushrelabel algorithm implemented directly … … 498 520 499 521 The matching algorithms implemented in LEMON: 522  \ref MaxBipartiteMatching HopcroftKarp augmenting path algorithm 523 for calculating maximum cardinality matching in bipartite graphs. 524  \ref PrBipartiteMatching Pushrelabel algorithm 525 for calculating maximum cardinality matching in bipartite graphs. 526  \ref MaxWeightedBipartiteMatching 527 Successive shortest path algorithm for calculating maximum weighted 528 matching and maximum weighted bipartite matching in bipartite graphs. 529  \ref MinCostMaxBipartiteMatching 530 Successive shortest path algorithm for calculating minimum cost maximum 531 matching in bipartite graphs. 500 532  \ref MaxMatching Edmond's blossom shrinking algorithm for calculating 501 533 maximum cardinality matching in general graphs. … … 622 654 623 655 /** 656 @defgroup lp_utils Tools for Lp and Mip Solvers 657 @ingroup lp_group 658 \brief Helper tools to the Lp and Mip solvers. 659 660 This group adds some helper tools to general optimization framework 661 implemented in LEMON. 662 */ 663 664 /** 665 @defgroup metah Metaheuristics 666 @ingroup gen_opt_group 667 \brief Metaheuristics for LEMON library. 668 669 This group contains some metaheuristic optimization tools. 670 */ 671 672 /** 624 673 @defgroup utils Tools and Utilities 625 674 \brief Tools and utilities for programming in LEMON
Note: See TracChangeset
for help on using the changeset viewer.