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