NEWS
author Alpar Juttner <alpar@cs.elte.hu>
Sat, 10 Aug 2013 14:27:19 +0200
branch1.2
changeset 1278 92d53f86d1a9
parent 1275 e38c9a70375c
permissions -rw-r--r--
LEMON 1.2.4 released (e13061207f85 tagged as r1.2.4)
alpar@1275
     1
2013-08-10 Version 1.2.4 released
alpar@1275
     2
alpar@1275
     3
        Bugfix release.
alpar@1275
     4
alpar@1275
     5
        #432: Add missing doc/template.h and doc/references.bib to release
alpar@1275
     6
              tarball
alpar@1275
     7
        #433: Support shared library build
alpar@1275
     8
        ----: Update CPLEX lookup
alpar@1275
     9
        ----: Make CBC interface compatible with latest CBC releases
alpar@1275
    10
        ----: Intel C++ compatibility fixes
alpar@1275
    11
        #441: Fix buggy reinitialization in _solver_bits::VarIndex::clear()
alpar@1275
    12
        #444: Bugfix in path copy constructors and assignment operators
alpar@1275
    13
        #447: Bugfix in AllArcLookUp<>
alpar@1275
    14
        #448: Bugfix in adaptor_test.cc
alpar@1275
    15
        #449: Fix clang compilation warnings and errors
alpar@1275
    16
        #440: Fix a bug + remove redundant typedefs in dimacs-solver
alpar@1275
    17
        #453: Avoid GCC 4.7 compiler warnings
alpar@1275
    18
        #445: Fix missing initialization in CplexEnv::CplexEnv()
alpar@1275
    19
        #461: Bugfix in assert.h
alpar@1275
    20
        #470: Fix compilation issues related to various gcc versions
alpar@1275
    21
        #439: Bugfix in biNodeConnected()
alpar@1277
    22
        #469: Bugfix in test/maps_test.cc
alpar@1275
    23
alpar@1099
    24
2011-11-09 Version 1.2.3 released
alpar@1099
    25
alpar@1099
    26
        Bugfix release.
alpar@1099
    27
alpar@1099
    28
        #428: Add missing lemon/lemon.pc.cmake to the release tarball
alpar@1099
    29
        #429: Fix VS warnings
alpar@1099
    30
        #430: Fix LpBase::Constr two-side limit bug
alpar@1099
    31
alpar@1083
    32
2011-08-08 Version 1.2.2 released
alpar@1083
    33
alpar@1083
    34
        Bugfix release.
alpar@1083
    35
alpar@1083
    36
        #392: Bug fix in Dfs::start(s,t)
alpar@1083
    37
        #414: Fix wrong initialization in Preflow
alpar@1083
    38
        #404: Update Doxygen configuration
alpar@1083
    39
        #416: Support tests with valgrind
alpar@1083
    40
        #418: Better Win CodeBlock/MinGW support
alpar@1083
    41
        #419: Backport build environment improvements from the main branch
alpar@1083
    42
              - Build of mip_test and lp_test precede the running of the tests
alpar@1083
    43
              - Also search for coin libs under ${COIN_ROOT_DIR}/lib/coin
alpar@1083
    44
              - Do not look for COIN_VOL libraries
alpar@1083
    45
        #382: Allow lgf file without Arc maps
alpar@1083
    46
        #417: Bug fix in CostScaling
alpar@1083
    47
alpar@1005
    48
2010-10-21 Version 1.2.1 released
alpar@1005
    49
alpar@1005
    50
        Bugfix release.
alpar@1005
    51
alpar@1005
    52
        #366: Fix Pred[Matrix]MapPath::empty()
alpar@1005
    53
        #371: Bug fix in (di)graphCopy()
alpar@1005
    54
              The target graph is cleared before adding nodes and arcs/edges.
alpar@1005
    55
alpar@1005
    56
        #364: Add missing UndirectedTags
alpar@1005
    57
        #368: Fix the usage of std::numeric_limits<>::min() in Network Simplex
alpar@1005
    58
        #372: Fix a critical bug in preflow
alpar@1005
    59
alpar@962
    60
2010-03-19 Version 1.2 released
alpar@962
    61
alpar@962
    62
        This is major feature release
alpar@962
    63
alpar@962
    64
        * New algorithms
alpar@962
    65
          * Bellman-Ford algorithm (#51)
alpar@962
    66
          * Minimum mean cycle algorithms (#179)
alpar@962
    67
            * Karp, Hartman-Orlin and Howard algorithms
alpar@962
    68
          * New minimum cost flow algorithms (#180)
alpar@962
    69
            * Cost Scaling algorithms
alpar@962
    70
            * Capacity Scaling algorithm
alpar@962
    71
            * Cycle-Canceling algorithms
alpar@962
    72
          * Planarity related algorithms (#62)
alpar@962
    73
            * Planarity checking algorithm
alpar@962
    74
            * Planar embedding algorithm
alpar@962
    75
            * Schnyder's planar drawing algorithm
alpar@962
    76
            * Coloring planar graphs with five or six colors
alpar@962
    77
          * Fractional matching algorithms (#314)
alpar@962
    78
        * New data structures
alpar@962
    79
          * StaticDigraph structure (#68)
alpar@962
    80
          * Several new priority queue structures (#50, #301)
alpar@962
    81
            * Fibonacci, Radix, Bucket, Pairing, Binomial
alpar@962
    82
              D-ary and fourary heaps (#301)
alpar@962
    83
          * Iterable map structures (#73)
alpar@962
    84
        * Other new tools and functionality
alpar@962
    85
          * Map utility functions (#320)
alpar@962
    86
          * Reserve functions are added to ListGraph and SmartGraph (#311)
alpar@962
    87
          * A resize() function is added to HypercubeGraph (#311)
alpar@962
    88
          * A count() function is added to CrossRefMap (#302)
alpar@962
    89
          * Support for multiple targets in Suurballe using fullInit() (#181)
alpar@962
    90
          * Traits class and named parameters for Suurballe (#323)
alpar@962
    91
          * Separate reset() and resetParams() functions in NetworkSimplex
alpar@962
    92
            to handle graph changes (#327)
alpar@962
    93
          * tolerance() functions are added to HaoOrlin (#306)
alpar@962
    94
        * Implementation improvements
alpar@962
    95
          * Improvements in weighted matching algorithms (#314)
alpar@962
    96
            * Jumpstart initialization
alpar@962
    97
          * ArcIt iteration is based on out-arc lists instead of in-arc lists
alpar@962
    98
            in ListDigraph (#311)
alpar@962
    99
          * Faster add row operation in CbcMip (#203)
alpar@962
   100
          * Better implementation for split() in ListDigraph (#311)
alpar@962
   101
          * ArgParser can also throw exception instead of exit(1) (#332)
alpar@962
   102
        * Miscellaneous
alpar@962
   103
          * A simple interactive bootstrap script
alpar@962
   104
          * Doc improvements (#62,#180,#299,#302,#303,#304,#307,#311,#331,#315,
alpar@962
   105
                #316,#319)
alpar@962
   106
            * BibTeX references in the doc (#184)
alpar@962
   107
          * Optionally use valgrind when running tests
alpar@962
   108
          * Also check ReferenceMapTag in concept checks (#312)
alpar@962
   109
          * dimacs-solver uses long long type by default.
alpar@962
   110
        * Several bugfixes (compared to release 1.1):
alpar@962
   111
          #295: Suppress MSVC warnings using pragmas
alpar@962
   112
          ----: Various CMAKE related improvements
alpar@962
   113
                * Remove duplications from doc/CMakeLists.txt
alpar@962
   114
                * Rename documentation install folder from 'docs' to 'html'
alpar@962
   115
                * Add tools/CMakeLists.txt to the tarball
alpar@962
   116
                * Generate and install LEMONConfig.cmake
alpar@962
   117
                * Change the label of the html project in Visual Studio
alpar@962
   118
                * Fix the check for the 'long long' type
alpar@962
   119
                * Put the version string into config.h
alpar@962
   120
                * Minor CMake improvements
alpar@962
   121
                * Set the version to 'hg-tip' if everything fails
alpar@962
   122
          #311: Add missing 'explicit' keywords
alpar@962
   123
          #302: Fix the implementation and doc of CrossRefMap
alpar@962
   124
          #308: Remove duplicate list_graph.h entry from source list
alpar@962
   125
          #307: Bugfix in Preflow and Circulation
alpar@962
   126
          #305: Bugfix and extension in the rename script
alpar@962
   127
          #312: Also check ReferenceMapTag in concept checks
alpar@962
   128
          #250: Bugfix in pathSource() and pathTarget()
alpar@962
   129
          #321: Use pathCopy(from,to) instead of copyPath(to,from)
alpar@962
   130
          #322: Distribure LEMONConfig.cmake.in
alpar@962
   131
          #330: Bug fix in map_extender.h
alpar@962
   132
          #336: Fix the date field comment of graphToEps() output
alpar@962
   133
          #323: Bug fix in Suurballe
alpar@962
   134
          #335: Fix clear() function in ExtendFindEnum
alpar@962
   135
          #337: Use void* as the LPX object pointer
alpar@962
   136
          #317: Fix (and improve) error message in mip_test.cc
alpar@962
   137
                Remove unnecessary OsiCbc dependency
alpar@962
   138
          #356: Allow multiple executions of weighted matching algorithms (#356)
alpar@962
   139
alpar@712
   140
2009-05-13 Version 1.1 released
alpar@712
   141
alpar@712
   142
        This is the second stable release of the 1.x series. It
alpar@712
   143
        features a better coverage of the tools available in the 0.x
alpar@712
   144
        series, a thoroughly reworked LP/MIP interface plus various
alpar@712
   145
        improvements in the existing tools.
alpar@712
   146
alpar@712
   147
        * Much improved M$ Windows support
alpar@712
   148
          * Various improvements in the CMAKE build system
alpar@712
   149
          * Compilation warnings are fixed/suppressed
alpar@712
   150
        * Support IBM xlC compiler
alpar@712
   151
        * New algorithms
alpar@712
   152
          * Connectivity related algorithms (#61)
alpar@712
   153
          * Euler walks (#65)
alpar@712
   154
          * Preflow push-relabel max. flow algorithm (#176)
alpar@712
   155
          * Circulation algorithm (push-relabel based) (#175)
alpar@712
   156
          * Suurballe algorithm (#47)
alpar@712
   157
          * Gomory-Hu algorithm (#66)
alpar@712
   158
          * Hao-Orlin algorithm (#58)
alpar@712
   159
          * Edmond's maximum cardinality and weighted matching algorithms
alpar@712
   160
            in general graphs (#48,#265)
alpar@712
   161
          * Minimum cost arborescence/branching (#60)
alpar@712
   162
          * Network Simplex min. cost flow algorithm (#234)
alpar@712
   163
        * New data structures
alpar@712
   164
          * Full graph structure (#57)
alpar@712
   165
          * Grid graph structure (#57)
alpar@712
   166
          * Hypercube graph structure (#57)
alpar@712
   167
          * Graph adaptors (#67)
alpar@712
   168
          * ArcSet and EdgeSet classes (#67)
alpar@712
   169
          * Elevator class (#174)
alpar@712
   170
        * Other new tools
alpar@712
   171
          * LP/MIP interface (#44)
alpar@712
   172
            * Support for GLPK, CPLEX, Soplex, COIN-OR CLP and CBC
alpar@712
   173
          * Reader for the Nauty file format (#55)
alpar@712
   174
          * DIMACS readers (#167)
alpar@712
   175
          * Radix sort algorithms (#72)
alpar@712
   176
          * RangeIdMap and CrossRefMap (#160)
alpar@712
   177
        * New command line tools
alpar@712
   178
          * DIMACS to LGF converter (#182)
alpar@712
   179
          * lgf-gen - a graph generator (#45)
alpar@712
   180
          * DIMACS solver utility (#226)
alpar@712
   181
        * Other code improvements
alpar@712
   182
          * Lognormal distribution added to Random (#102)
alpar@712
   183
          * Better (i.e. O(1) time) item counting in SmartGraph (#3)
alpar@712
   184
          * The standard maps of graphs are guaranteed to be
alpar@712
   185
            reference maps (#190)
alpar@712
   186
        * Miscellaneous
alpar@712
   187
          * Various doc improvements
alpar@712
   188
          * Improved 0.x -> 1.x converter script
alpar@712
   189
alpar@712
   190
        * Several bugfixes (compared to release 1.0):
alpar@712
   191
          #170: Bugfix SmartDigraph::split()
alpar@712
   192
          #171: Bugfix in SmartGraph::restoreSnapshot()
alpar@712
   193
          #172: Extended test cases for graphs and digraphs
alpar@712
   194
          #173: Bugfix in Random
alpar@712
   195
                * operator()s always return a double now
alpar@712
   196
                * the faulty real<Num>(Num) and real<Num>(Num,Num)
alpar@712
   197
                  have been removed
alpar@712
   198
          #187: Remove DijkstraWidestPathOperationTraits
alpar@712
   199
          #61:  Bugfix in DfsVisit
alpar@712
   200
          #193: Bugfix in GraphReader::skipSection()
alpar@712
   201
          #195: Bugfix in ConEdgeIt()
alpar@712
   202
          #197: Bugfix in heap unionfind
alpar@712
   203
                * This bug affects Edmond's general matching algorithms
alpar@712
   204
          #207: Fix 'make install' without 'make html' using CMAKE
alpar@712
   205
          #208: Suppress or fix VS2008 compilation warnings
alpar@712
   206
          ----: Update the LEMON icon
alpar@712
   207
          ----: Enable the component-based installer
alpar@712
   208
                (in installers made by CPACK)
alpar@712
   209
          ----: Set the proper version for CMAKE in the tarballs
alpar@712
   210
                (made by autotools)
alpar@712
   211
          ----: Minor clarification in the LICENSE file
alpar@712
   212
          ----: Add missing unistd.h include to time_measure.h
alpar@712
   213
          #204: Compilation bug fixed in graph_to_eps.h with VS2005
alpar@962
   214
          #214,#215: windows.h should never be included by LEMON headers
alpar@712
   215
          #230: Build systems check the availability of 'long long' type
alpar@712
   216
          #229: Default implementation of Tolerance<> is used for integer types
alpar@712
   217
          #211,#212: Various fixes for compiling on AIX
alpar@712
   218
          ----: Improvements in CMAKE config
alpar@712
   219
                - docs is installed in share/doc/
alpar@712
   220
                - detects newer versions of Ghostscript
alpar@712
   221
          #239: Fix missing 'inline' specifier in time_measure.h
alpar@712
   222
          #274,#280: Install lemon/config.h
alpar@712
   223
          #275: Prefix macro names with LEMON_ in lemon/config.h
alpar@712
   224
          ----: Small script for making the release tarballs added
alpar@712
   225
          ----: Minor improvement in unify-sources.sh (a76f55d7d397)
alpar@712
   226
alpar@534
   227
2009-03-27 LEMON joins to the COIN-OR initiative
alpar@534
   228
alpar@534
   229
        COIN-OR (Computational Infrastructure for Operations Research,
alpar@534
   230
        http://www.coin-or.org) project is an initiative to spur the
alpar@534
   231
        development of open-source software for the operations research
alpar@534
   232
        community.
alpar@534
   233
alpar@322
   234
2008-10-13 Version 1.0 released
alpar@262
   235
alpar@962
   236
        This is the first stable release of LEMON. Compared to the 0.x
alpar@962
   237
        release series, it features a considerably smaller but more
alpar@962
   238
        matured set of tools. The API has also completely revised and
alpar@962
   239
        changed in several places.
alpar@262
   240
alpar@962
   241
        * The major name changes compared to the 0.x series (see the
alpar@322
   242
          Migration Guide in the doc for more details)
alpar@262
   243
          * Graph -> Digraph, UGraph -> Graph
alpar@262
   244
          * Edge -> Arc, UEdge -> Edge
alpar@962
   245
          * source(UEdge)/target(UEdge) -> u(Edge)/v(Edge)
alpar@962
   246
        * Other improvements
alpar@962
   247
          * Better documentation
alpar@962
   248
          * Reviewed and cleaned up codebase
alpar@962
   249
          * CMake based build system (along with the autotools based one)
alpar@962
   250
        * Contents of the library (ported from 0.x)
alpar@962
   251
          * Algorithms
alpar@962
   252
            * breadth-first search (bfs.h)
alpar@962
   253
            * depth-first search (dfs.h)
alpar@962
   254
            * Dijkstra's algorithm (dijkstra.h)
alpar@962
   255
            * Kruskal's algorithm (kruskal.h)
alpar@962
   256
          * Data structures
alpar@962
   257
            * graph data structures (list_graph.h, smart_graph.h)
alpar@962
   258
            * path data structures (path.h)
alpar@962
   259
            * binary heap data structure (bin_heap.h)
alpar@962
   260
            * union-find data structures (unionfind.h)
alpar@962
   261
            * miscellaneous property maps (maps.h)
alpar@962
   262
            * two dimensional vector and bounding box (dim2.h)
alpar@262
   263
          * Concepts
alpar@962
   264
            * graph structure concepts (concepts/digraph.h, concepts/graph.h,
alpar@262
   265
              concepts/graph_components.h)
alpar@962
   266
            * concepts for other structures (concepts/heap.h, concepts/maps.h,
alpar@962
   267
              concepts/path.h)
alpar@962
   268
          * Tools
alpar@962
   269
            * Mersenne twister random number generator (random.h)
alpar@962
   270
            * tools for measuring cpu and wall clock time (time_measure.h)
alpar@962
   271
            * tools for counting steps and events (counter.h)
alpar@962
   272
            * tool for parsing command line arguments (arg_parser.h)
alpar@962
   273
            * tool for visualizing graphs (graph_to_eps.h)
alpar@962
   274
            * tools for reading and writing data in LEMON Graph Format
alpar@262
   275
              (lgf_reader.h, lgf_writer.h)
alpar@262
   276
            * tools to handle the anomalies of calculations with
alpar@962
   277
              floating point numbers (tolerance.h)
alpar@262
   278
            * tools to manage RGB colors (color.h)
alpar@962
   279
          * Infrastructure
alpar@962
   280
            * extended assertion handling (assert.h)
alpar@962
   281
            * exception classes and error handling (error.h)
alpar@962
   282
            * concept checking (concept_check.h)
alpar@962
   283
            * commonly used mathematical constants (math.h)