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