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