1 2013-08-10 Version 1.1.6 released
3 Release series 1.1 has reached its end of life. This is the last
4 bugfix release in that series.
6 #432: Add missing doc/template.h to release tarball
7 #433: Support shared library build
8 ----: Update CPLEX lookup
9 ----: Make CBC interface compatible with latest CBC releases
10 ----: Intel C++ compatibility fixes
11 #441: Fix buggy reinitialization in _solver_bits::VarIndex::clear()
12 #444: Bugfix in path copy constructors and assignment operators
13 #447: Bugfix in AllArcLookUp<>
14 #448: Bugfix in adaptor_test.cc
15 #449: Fix clang compilation warnings and errors
16 #440: Fix a bug + remove redundant typedefs in dimacs-solver
17 #453: Avoid GCC 4.7 compiler warnings
18 #445: Fix missing initialization in CplexEnv::CplexEnv()
19 #470: Suppress 'unused local typedefs' warnings, and resolve others
20 #461: Bugfix in assert.h
21 #294: Add explicit namespace to ignore_unused_variable_warning() usages
22 #439: Fix biNodeConnected() function
23 #439: Clarification in biNodeConnected() doc
24 ----: Remove -Werror form AM_INIT_AUTOMAKE
26 2011-11-09 Version 1.1.5 released
30 #428: Add missing lemon/lemon.pc.cmake to the release tarball
32 #430: Fix LpBase::Constr two-side limit bug
34 2011-08-08 Version 1.1.4 released
38 #392: Bug fix in Dfs::start(s,t)
39 #414: Fix wrong initialization in Preflow
40 #404: Update Doxygen configuration
41 #416: Support tests with valgrind
42 #418: Better Win CodeBlock/MinGW support
43 #419: Backport build environment improvements from the main branch
44 - Build of mip_test and lp_test precede the running of the tests
45 - Also search for coin libs under ${COIN_ROOT_DIR}/lib/coin
46 - Do not look for COIN_VOL libraries
47 #382: Allow lgf file without Arc maps
49 2010-10-21 Version 1.1.3 released
53 #366: Fix Pred[Matrix]MapPath::empty()
54 #371: Bug fix in (di)graphCopy()
55 The target graph is cleared before adding nodes and arcs/edges.
57 #356: Fix multiple execution bug in weighted matchings
58 #364: Add missing UndirectedTags
59 #368: Fix the usage of std::numeric_limits<>::min() in Network Simplex
60 #372: Fix a critical bug in preflow
62 2010-03-08 Version 1.1.2 released
66 #317: Fix (and improve) error message in mip_test.cc
67 Remove unnecessary OsiCbc dependency
68 #250: Fix in pathSource() and pathTarget()
69 #322: Distribute LEMONConfig.cmake.in
70 #321: Use pathCopy(from,to) instead of copyPath(to,from)
71 #330: Bug fix in map_extender.h
72 #335: Fix clear() function in ExtendFindEnum
73 #337: Use void* as LPX object pointer
74 #336: Fix the date field comment of graphToEps() output
75 #323: Bug fix in Suurballe
77 2009-10-03 Version 1.1.1 released
81 #295: Suppress MSVC warnings using pragmas
82 ----: Various CMAKE related improvements
83 * Remove duplications from doc/CMakeLists.txt
84 * Rename documentation install folder from 'docs' to 'html'
85 * Add tools/CMakeLists.txt to the tarball
86 * Generate and install LEMONConfig.cmake
87 * Change the label of the html project in Visual Studio
88 * Fix the check for the 'long long' type
89 * Put the version string into config.h
90 * Minor CMake improvements
91 * Set the version to 'hg-tip' if everything fails
92 #311: Add missing 'explicit' keywords
93 #302: Fix the implementation and doc of CrossRefMap
94 #308: Remove duplicate list_graph.h entry from source list
95 #307: Bug fix in Preflow and Circulation
97 2009-05-13 Version 1.1 released
99 This is the second stable release of the 1.x series. It
100 features a better coverage of the tools available in the 0.x
101 series, a thoroughly reworked LP/MIP interface plus various
102 improvements in the existing tools.
104 * Much improved M$ Windows support
105 * Various improvements in the CMAKE build system
106 * Compilation warnings are fixed/suppressed
107 * Support IBM xlC compiler
109 * Connectivity related algorithms (#61)
111 * Preflow push-relabel max. flow algorithm (#176)
112 * Circulation algorithm (push-relabel based) (#175)
113 * Suurballe algorithm (#47)
114 * Gomory-Hu algorithm (#66)
115 * Hao-Orlin algorithm (#58)
116 * Edmond's maximum cardinality and weighted matching algorithms
117 in general graphs (#48,#265)
118 * Minimum cost arborescence/branching (#60)
119 * Network Simplex min. cost flow algorithm (#234)
120 * New data structures
121 * Full graph structure (#57)
122 * Grid graph structure (#57)
123 * Hypercube graph structure (#57)
124 * Graph adaptors (#67)
125 * ArcSet and EdgeSet classes (#67)
126 * Elevator class (#174)
128 * LP/MIP interface (#44)
129 * Support for GLPK, CPLEX, Soplex, COIN-OR CLP and CBC
130 * Reader for the Nauty file format (#55)
131 * DIMACS readers (#167)
132 * Radix sort algorithms (#72)
133 * RangeIdMap and CrossRefMap (#160)
134 * New command line tools
135 * DIMACS to LGF converter (#182)
136 * lgf-gen - a graph generator (#45)
137 * DIMACS solver utility (#226)
138 * Other code improvements
139 * Lognormal distribution added to Random (#102)
140 * Better (i.e. O(1) time) item counting in SmartGraph (#3)
141 * The standard maps of graphs are guaranteed to be
142 reference maps (#190)
144 * Various doc improvements
145 * Improved 0.x -> 1.x converter script
147 * Several bugfixes (compared to release 1.0):
148 #170: Bugfix SmartDigraph::split()
149 #171: Bugfix in SmartGraph::restoreSnapshot()
150 #172: Extended test cases for graphs and digraphs
151 #173: Bugfix in Random
152 * operator()s always return a double now
153 * the faulty real<Num>(Num) and real<Num>(Num,Num)
155 #187: Remove DijkstraWidestPathOperationTraits
156 #61: Bugfix in DfsVisit
157 #193: Bugfix in GraphReader::skipSection()
158 #195: Bugfix in ConEdgeIt()
159 #197: Bugfix in heap unionfind
160 * This bug affects Edmond's general matching algorithms
161 #207: Fix 'make install' without 'make html' using CMAKE
162 #208: Suppress or fix VS2008 compilation warnings
163 ----: Update the LEMON icon
164 ----: Enable the component-based installer
165 (in installers made by CPACK)
166 ----: Set the proper version for CMAKE in the tarballs
168 ----: Minor clarification in the LICENSE file
169 ----: Add missing unistd.h include to time_measure.h
170 #204: Compilation bug fixed in graph_to_eps.h with VS2005
171 #214,#215: windows.h should never be included by lemon headers
172 #230: Build systems check the availability of 'long long' type
173 #229: Default implementation of Tolerance<> is used for integer types
174 #211,#212: Various fixes for compiling on AIX
175 ----: Improvements in CMAKE config
176 - docs is installed in share/doc/
177 - detects newer versions of Ghostscript
178 #239: Fix missing 'inline' specifier in time_measure.h
179 #274,#280: Install lemon/config.h
180 #275: Prefix macro names with LEMON_ in lemon/config.h
181 ----: Small script for making the release tarballs added
182 ----: Minor improvement in unify-sources.sh (a76f55d7d397)
184 2009-03-27 LEMON joins to the COIN-OR initiative
186 COIN-OR (Computational Infrastructure for Operations Research,
187 http://www.coin-or.org) project is an initiative to spur the
188 development of open-source software for the operations research
191 2008-10-13 Version 1.0 released
193 This is the first stable release of LEMON. Compared to the 0.x
194 release series, it features a considerably smaller but more
195 matured set of tools. The API has also completely revised and
196 changed in several places.
198 * The major name changes compared to the 0.x series (see the
199 Migration Guide in the doc for more details)
200 * Graph -> Digraph, UGraph -> Graph
201 * Edge -> Arc, UEdge -> Edge
202 * source(UEdge)/target(UEdge) -> u(Edge)/v(Edge)
204 * Better documentation
205 * Reviewed and cleaned up codebase
206 * CMake based build system (along with the autotools based one)
207 * Contents of the library (ported from 0.x)
209 * breadth-first search (bfs.h)
210 * depth-first search (dfs.h)
211 * Dijkstra's algorithm (dijkstra.h)
212 * Kruskal's algorithm (kruskal.h)
214 * graph data structures (list_graph.h, smart_graph.h)
215 * path data structures (path.h)
216 * binary heap data structure (bin_heap.h)
217 * union-find data structures (unionfind.h)
218 * miscellaneous property maps (maps.h)
219 * two dimensional vector and bounding box (dim2.h)
221 * graph structure concepts (concepts/digraph.h, concepts/graph.h,
222 concepts/graph_components.h)
223 * concepts for other structures (concepts/heap.h, concepts/maps.h,
226 * Mersenne twister random number generator (random.h)
227 * tools for measuring cpu and wall clock time (time_measure.h)
228 * tools for counting steps and events (counter.h)
229 * tool for parsing command line arguments (arg_parser.h)
230 * tool for visualizing graphs (graph_to_eps.h)
231 * tools for reading and writing data in LEMON Graph Format
232 (lgf_reader.h, lgf_writer.h)
233 * tools to handle the anomalies of calculations with
234 floating point numbers (tolerance.h)
235 * tools to manage RGB colors (color.h)
237 * extended assertion handling (assert.h)
238 * exception classes and error handling (error.h)
239 * concept checking (concept_check.h)
240 * commonly used mathematical constants (math.h)