1 |
2010-03-08 Version 1.1.2 released |
|
2 |
|
|
3 |
Bugfix release. |
|
4 |
|
|
5 |
#317: Fix (and improve) error message in mip_test.cc |
|
6 |
Remove unnecessary OsiCbc dependency |
|
7 |
#250: Fix in pathSource() and pathTarget() |
|
8 |
#322: Distribute LEMONConfig.cmake.in |
|
9 |
#321: Use pathCopy(from,to) instead of copyPath(to,from) |
|
10 |
#330: Bug fix in map_extender.h |
|
11 |
#335: Fix clear() function in ExtendFindEnum |
|
12 |
#337: Use void* as LPX object pointer |
|
13 |
#336: Fix the date field comment of graphToEps() output |
|
14 |
#323: Bug fix in Suurballe |
|
15 |
|
|
1 | 16 |
2009-10-03 Version 1.1.1 released |
2 | 17 |
|
3 | 18 |
Bugfix release. |
4 | 19 |
|
5 | 20 |
#295: Suppress MSVC warnings using pragmas |
6 | 21 |
----: Various CMAKE related improvements |
7 | 22 |
* Remove duplications from doc/CMakeLists.txt |
8 | 23 |
* Rename documentation install folder from 'docs' to 'html' |
9 | 24 |
* Add tools/CMakeLists.txt to the tarball |
10 | 25 |
* Generate and install LEMONConfig.cmake |
11 | 26 |
* Change the label of the html project in Visual Studio |
12 | 27 |
* Fix the check for the 'long long' type |
13 | 28 |
* Put the version string into config.h |
14 | 29 |
* Minor CMake improvements |
15 | 30 |
* Set the version to 'hg-tip' if everything fails |
16 | 31 |
#311: Add missing 'explicit' keywords |
17 | 32 |
#302: Fix the implementation and doc of CrossRefMap |
18 | 33 |
#308: Remove duplicate list_graph.h entry from source list |
19 | 34 |
#307: Bug fix in Preflow and Circulation |
20 | 35 |
|
21 | 36 |
2009-05-13 Version 1.1 released |
22 | 37 |
|
23 | 38 |
This is the second stable release of the 1.x series. It |
24 | 39 |
features a better coverage of the tools available in the 0.x |
25 | 40 |
series, a thoroughly reworked LP/MIP interface plus various |
26 | 41 |
improvements in the existing tools. |
27 | 42 |
|
28 | 43 |
* Much improved M$ Windows support |
29 | 44 |
* Various improvements in the CMAKE build system |
30 | 45 |
* Compilation warnings are fixed/suppressed |
31 | 46 |
* Support IBM xlC compiler |
32 | 47 |
* New algorithms |
33 | 48 |
* Connectivity related algorithms (#61) |
34 | 49 |
* Euler walks (#65) |
35 | 50 |
* Preflow push-relabel max. flow algorithm (#176) |
36 | 51 |
* Circulation algorithm (push-relabel based) (#175) |
37 | 52 |
* Suurballe algorithm (#47) |
38 | 53 |
* Gomory-Hu algorithm (#66) |
39 | 54 |
* Hao-Orlin algorithm (#58) |
40 | 55 |
* Edmond's maximum cardinality and weighted matching algorithms |
41 | 56 |
in general graphs (#48,#265) |
42 | 57 |
* Minimum cost arborescence/branching (#60) |
43 | 58 |
* Network Simplex min. cost flow algorithm (#234) |
44 | 59 |
* New data structures |
45 | 60 |
* Full graph structure (#57) |
46 | 61 |
* Grid graph structure (#57) |
47 | 62 |
* Hypercube graph structure (#57) |
48 | 63 |
* Graph adaptors (#67) |
0 comments (0 inline)