alpar@881: 2010-03-19 Version 1.2 released
alpar@881: 
alpar@881:         This is major feature release
alpar@881: 
alpar@881:         * New algorithms
alpar@881:           * Bellman-Ford algorithm (#51)
alpar@881:           * Minimum mean cycle algorithms (#179)
alpar@881:             * Karp, Hartman-Orlin and Howard algorithms
alpar@881:           * New minimum cost flow algorithms (#180)
alpar@881:             * Cost Scaling algorithms
alpar@881:             * Capacity Scaling algorithm
alpar@881:             * Cycle-Canceling algorithms
alpar@881:           * Planarity related algorithms (#62)
alpar@881:             * Planarity checking algorithm
alpar@881:             * Planar embedding algorithm
alpar@881:             * Schnyder's planar drawing algorithm
alpar@881:             * Coloring planar graphs with five or six colors
alpar@881:           * Fractional matching algorithms (#314)
alpar@881:         * New data structures
alpar@881:           * StaticDigraph structure (#68)
alpar@881:           * Several new priority queue structures (#50, #301)
alpar@881:             * Fibonacci, Radix, Bucket, Pairing, Binomial
alpar@881:               D-ary and fourary heaps (#301)
alpar@881:           * Iterable map structures (#73)
alpar@881:         * Other new tools and functionality
alpar@881:           * Map utility functions (#320)
alpar@881:           * Reserve functions are added to ListGraph and SmartGraph (#311)
alpar@881:           * A resize() function is added to HypercubeGraph (#311)
alpar@881:           * A count() function is added to CrossRefMap (#302)
alpar@881:           * Support for multiple targets in Suurballe using fullInit() (#181)
alpar@881:           * Traits class and named parameters for Suurballe (#323)
alpar@881:           * Separate reset() and resetParams() functions in NetworkSimplex
alpar@881:             to handle graph changes (#327)
alpar@881:           * tolerance() functions are added to HaoOrlin (#306)
alpar@881:         * Implementation improvements
alpar@881:           * Improvements in weighted matching algorithms (#314)
alpar@881:             * Jumpstart initialization
alpar@881:           * ArcIt iteration is based on out-arc lists instead of in-arc lists
alpar@881:             in ListDigraph (#311)
alpar@881:           * Faster add row operation in CbcMip (#203)
alpar@881:           * Better implementation for split() in ListDigraph (#311)
alpar@881:           * ArgParser can also throw exception instead of exit(1) (#332)
alpar@881:         * Miscellaneous
alpar@881:           * A simple interactive bootstrap script
alpar@881:           * Doc improvements (#62,#180,#299,#302,#303,#304,#307,#311,#331,#315,
alpar@881:                 #316,#319)
alpar@881:             * BibTeX references in the doc (#184)
alpar@881:           * Optionally use valgrind when running tests
alpar@881:           * Also check ReferenceMapTag in concept checks (#312)
alpar@881:           * dimacs-solver uses long long type by default.
alpar@881:         * Several bugfixes (compared to release 1.1):
alpar@881:           #295: Suppress MSVC warnings using pragmas
alpar@881:           ----: Various CMAKE related improvements
alpar@881:                 * Remove duplications from doc/CMakeLists.txt
alpar@881:                 * Rename documentation install folder from 'docs' to 'html'
alpar@881:                 * Add tools/CMakeLists.txt to the tarball
alpar@881:                 * Generate and install LEMONConfig.cmake
alpar@881:                 * Change the label of the html project in Visual Studio
alpar@881:                 * Fix the check for the 'long long' type
alpar@881:                 * Put the version string into config.h
alpar@881:                 * Minor CMake improvements
alpar@881:                 * Set the version to 'hg-tip' if everything fails
alpar@881:           #311: Add missing 'explicit' keywords
alpar@881:           #302: Fix the implementation and doc of CrossRefMap
alpar@881:           #308: Remove duplicate list_graph.h entry from source list
alpar@881:           #307: Bugfix in Preflow and Circulation
alpar@881:           #305: Bugfix and extension in the rename script
alpar@881:           #312: Also check ReferenceMapTag in concept checks
alpar@881:           #250: Bugfix in pathSource() and pathTarget()
alpar@881:           #321: Use pathCopy(from,to) instead of copyPath(to,from)
alpar@881:           #322: Distribure LEMONConfig.cmake.in
alpar@881:           #330: Bug fix in map_extender.h
alpar@881:           #336: Fix the date field comment of graphToEps() output
alpar@881:           #323: Bug fix in Suurballe
alpar@881:           #335: Fix clear() function in ExtendFindEnum
alpar@881:           #337: Use void* as the LPX object pointer
alpar@881:           #317: Fix (and improve) error message in mip_test.cc
alpar@881:                 Remove unnecessary OsiCbc dependency
alpar@881:           #356: Allow multiple executions of weighted matching algorithms (#356)
alpar@881: 
alpar@665: 2009-05-13 Version 1.1 released
alpar@665: 
alpar@665:         This is the second stable release of the 1.x series. It
alpar@665:         features a better coverage of the tools available in the 0.x
alpar@665:         series, a thoroughly reworked LP/MIP interface plus various
alpar@665:         improvements in the existing tools.
alpar@665: 
alpar@665:         * Much improved M$ Windows support
alpar@665:           * Various improvements in the CMAKE build system
alpar@665:           * Compilation warnings are fixed/suppressed
alpar@665:         * Support IBM xlC compiler
alpar@665:         * New algorithms
alpar@665:           * Connectivity related algorithms (#61)
alpar@665:           * Euler walks (#65)
alpar@665:           * Preflow push-relabel max. flow algorithm (#176)
alpar@665:           * Circulation algorithm (push-relabel based) (#175)
alpar@665:           * Suurballe algorithm (#47)
alpar@665:           * Gomory-Hu algorithm (#66)
alpar@665:           * Hao-Orlin algorithm (#58)
alpar@665:           * Edmond's maximum cardinality and weighted matching algorithms
alpar@665:             in general graphs (#48,#265)
alpar@665:           * Minimum cost arborescence/branching (#60)
alpar@665:           * Network Simplex min. cost flow algorithm (#234)
alpar@665:         * New data structures
alpar@665:           * Full graph structure (#57)
alpar@665:           * Grid graph structure (#57)
alpar@665:           * Hypercube graph structure (#57)
alpar@665:           * Graph adaptors (#67)
alpar@665:           * ArcSet and EdgeSet classes (#67)
alpar@665:           * Elevator class (#174)
alpar@665:         * Other new tools
alpar@665:           * LP/MIP interface (#44)
alpar@665:             * Support for GLPK, CPLEX, Soplex, COIN-OR CLP and CBC
alpar@665:           * Reader for the Nauty file format (#55)
alpar@665:           * DIMACS readers (#167)
alpar@665:           * Radix sort algorithms (#72)
alpar@665:           * RangeIdMap and CrossRefMap (#160)
alpar@665:         * New command line tools
alpar@665:           * DIMACS to LGF converter (#182)
alpar@665:           * lgf-gen - a graph generator (#45)
alpar@665:           * DIMACS solver utility (#226)
alpar@665:         * Other code improvements
alpar@665:           * Lognormal distribution added to Random (#102)
alpar@665:           * Better (i.e. O(1) time) item counting in SmartGraph (#3)
alpar@665:           * The standard maps of graphs are guaranteed to be
alpar@665:             reference maps (#190)
alpar@665:         * Miscellaneous
alpar@665:           * Various doc improvements
alpar@665:           * Improved 0.x -> 1.x converter script
alpar@665: 
alpar@665:         * Several bugfixes (compared to release 1.0):
alpar@665:           #170: Bugfix SmartDigraph::split()
alpar@665:           #171: Bugfix in SmartGraph::restoreSnapshot()
alpar@665:           #172: Extended test cases for graphs and digraphs
alpar@665:           #173: Bugfix in Random
alpar@665:                 * operator()s always return a double now
alpar@665:                 * the faulty real<Num>(Num) and real<Num>(Num,Num)
alpar@665:                   have been removed
alpar@665:           #187: Remove DijkstraWidestPathOperationTraits
alpar@665:           #61:  Bugfix in DfsVisit
alpar@665:           #193: Bugfix in GraphReader::skipSection()
alpar@665:           #195: Bugfix in ConEdgeIt()
alpar@665:           #197: Bugfix in heap unionfind
alpar@665:                 * This bug affects Edmond's general matching algorithms
alpar@665:           #207: Fix 'make install' without 'make html' using CMAKE
alpar@665:           #208: Suppress or fix VS2008 compilation warnings
alpar@665:           ----: Update the LEMON icon
alpar@665:           ----: Enable the component-based installer
alpar@665:                 (in installers made by CPACK)
alpar@665:           ----: Set the proper version for CMAKE in the tarballs
alpar@665:                 (made by autotools)
alpar@665:           ----: Minor clarification in the LICENSE file
alpar@665:           ----: Add missing unistd.h include to time_measure.h
alpar@665:           #204: Compilation bug fixed in graph_to_eps.h with VS2005
alpar@881:           #214,#215: windows.h should never be included by LEMON headers
alpar@665:           #230: Build systems check the availability of 'long long' type
alpar@665:           #229: Default implementation of Tolerance<> is used for integer types
alpar@665:           #211,#212: Various fixes for compiling on AIX
alpar@665:           ----: Improvements in CMAKE config
alpar@665:                 - docs is installed in share/doc/
alpar@665:                 - detects newer versions of Ghostscript
alpar@665:           #239: Fix missing 'inline' specifier in time_measure.h
alpar@665:           #274,#280: Install lemon/config.h
alpar@665:           #275: Prefix macro names with LEMON_ in lemon/config.h
alpar@665:           ----: Small script for making the release tarballs added
alpar@665:           ----: Minor improvement in unify-sources.sh (a76f55d7d397)
alpar@665: 
alpar@507: 2009-03-27 LEMON joins to the COIN-OR initiative
alpar@507: 
alpar@507:         COIN-OR (Computational Infrastructure for Operations Research,
alpar@507:         http://www.coin-or.org) project is an initiative to spur the
alpar@507:         development of open-source software for the operations research
alpar@507:         community.
alpar@507: 
alpar@322: 2008-10-13 Version 1.0 released
alpar@262: 
alpar@881:         This is the first stable release of LEMON. Compared to the 0.x
alpar@881:         release series, it features a considerably smaller but more
alpar@881:         matured set of tools. The API has also completely revised and
alpar@881:         changed in several places.
alpar@262: 
alpar@881:         * The major name changes compared to the 0.x series (see the
alpar@322:           Migration Guide in the doc for more details)
alpar@262:           * Graph -> Digraph, UGraph -> Graph
alpar@262:           * Edge -> Arc, UEdge -> Edge
alpar@881:           * source(UEdge)/target(UEdge) -> u(Edge)/v(Edge)
alpar@881:         * Other improvements
alpar@881:           * Better documentation
alpar@881:           * Reviewed and cleaned up codebase
alpar@881:           * CMake based build system (along with the autotools based one)
alpar@881:         * Contents of the library (ported from 0.x)
alpar@881:           * Algorithms
alpar@881:             * breadth-first search (bfs.h)
alpar@881:             * depth-first search (dfs.h)
alpar@881:             * Dijkstra's algorithm (dijkstra.h)
alpar@881:             * Kruskal's algorithm (kruskal.h)
alpar@881:           * Data structures
alpar@881:             * graph data structures (list_graph.h, smart_graph.h)
alpar@881:             * path data structures (path.h)
alpar@881:             * binary heap data structure (bin_heap.h)
alpar@881:             * union-find data structures (unionfind.h)
alpar@881:             * miscellaneous property maps (maps.h)
alpar@881:             * two dimensional vector and bounding box (dim2.h)
alpar@262:           * Concepts
alpar@881:             * graph structure concepts (concepts/digraph.h, concepts/graph.h,
alpar@262:               concepts/graph_components.h)
alpar@881:             * concepts for other structures (concepts/heap.h, concepts/maps.h,
alpar@881:               concepts/path.h)
alpar@881:           * Tools
alpar@881:             * Mersenne twister random number generator (random.h)
alpar@881:             * tools for measuring cpu and wall clock time (time_measure.h)
alpar@881:             * tools for counting steps and events (counter.h)
alpar@881:             * tool for parsing command line arguments (arg_parser.h)
alpar@881:             * tool for visualizing graphs (graph_to_eps.h)
alpar@881:             * tools for reading and writing data in LEMON Graph Format
alpar@262:               (lgf_reader.h, lgf_writer.h)
alpar@262:             * tools to handle the anomalies of calculations with
alpar@881:               floating point numbers (tolerance.h)
alpar@262:             * tools to manage RGB colors (color.h)
alpar@881:           * Infrastructure
alpar@881:             * extended assertion handling (assert.h)
alpar@881:             * exception classes and error handling (error.h)
alpar@881:             * concept checking (concept_check.h)
alpar@881:             * commonly used mathematical constants (math.h)