r1080:f22bc76370b2
Fri, 05 Aug 2011 09:33:42
[Not Reviewed]
0 comments (0 inline)
0
1
0
15
| 1 |
2011-08-08 Version 1.1.4 released |
|
| 2 |
|
|
| 3 |
Bugfix release. |
|
| 4 |
|
|
| 5 |
#392: Bug fix in Dfs::start(s,t) |
|
| 6 |
#414: Fix wrong initialization in Preflow |
|
| 7 |
#404: Update Doxygen configuration |
|
| 8 |
#416: Support tests with valgrind |
|
| 9 |
#418: Better Win CodeBlock/MinGW support |
|
| 10 |
#419: Backport build environment improvements from the main branch |
|
| 11 |
- Build of mip_test and lp_test precede the running of the tests |
|
| 12 |
- Also search for coin libs under ${COIN_ROOT_DIR}/lib/coin
|
|
| 13 |
- Do not look for COIN_VOL libraries |
|
| 14 |
#382: Allow lgf file without Arc maps |
|
| 15 |
|
|
| 1 | 16 |
2010-10-21 Version 1.1.3 released |
| 2 | 17 |
|
| 3 | 18 |
Bugfix release. |
| 4 | 19 |
|
| 5 | 20 |
#366: Fix Pred[Matrix]MapPath::empty() |
| 6 | 21 |
#371: Bug fix in (di)graphCopy() |
| 7 | 22 |
The target graph is cleared before adding nodes and arcs/edges. |
| 8 | 23 |
|
| 9 | 24 |
#356: Fix multiple execution bug in weighted matchings |
| 10 | 25 |
#364: Add missing UndirectedTags |
| 11 | 26 |
#368: Fix the usage of std::numeric_limits<>::min() in Network Simplex |
| 12 | 27 |
#372: Fix a critical bug in preflow |
| 13 | 28 |
|
| 14 | 29 |
2010-03-08 Version 1.1.2 released |
| 15 | 30 |
|
| 16 | 31 |
Bugfix release. |
| 17 | 32 |
|
| 18 | 33 |
#317: Fix (and improve) error message in mip_test.cc |
| 19 | 34 |
Remove unnecessary OsiCbc dependency |
| 20 | 35 |
#250: Fix in pathSource() and pathTarget() |
| 21 | 36 |
#322: Distribute LEMONConfig.cmake.in |
| 22 | 37 |
#321: Use pathCopy(from,to) instead of copyPath(to,from) |
| 23 | 38 |
#330: Bug fix in map_extender.h |
| 24 | 39 |
#335: Fix clear() function in ExtendFindEnum |
| 25 | 40 |
#337: Use void* as LPX object pointer |
| 26 | 41 |
#336: Fix the date field comment of graphToEps() output |
| 27 | 42 |
#323: Bug fix in Suurballe |
| 28 | 43 |
|
| 29 | 44 |
2009-10-03 Version 1.1.1 released |
| 30 | 45 |
|
| 31 | 46 |
Bugfix release. |
| 32 | 47 |
|
| 33 | 48 |
#295: Suppress MSVC warnings using pragmas |
| 34 | 49 |
----: Various CMAKE related improvements |
| 35 | 50 |
* Remove duplications from doc/CMakeLists.txt |
| 36 | 51 |
* Rename documentation install folder from 'docs' to 'html' |
| 37 | 52 |
* Add tools/CMakeLists.txt to the tarball |
| 38 | 53 |
* Generate and install LEMONConfig.cmake |
| 39 | 54 |
* Change the label of the html project in Visual Studio |
| 40 | 55 |
* Fix the check for the 'long long' type |
| 41 | 56 |
* Put the version string into config.h |
| 42 | 57 |
* Minor CMake improvements |
| 43 | 58 |
* Set the version to 'hg-tip' if everything fails |
| 44 | 59 |
#311: Add missing 'explicit' keywords |
| 45 | 60 |
#302: Fix the implementation and doc of CrossRefMap |
| 46 | 61 |
#308: Remove duplicate list_graph.h entry from source list |
| 47 | 62 |
#307: Bug fix in Preflow and Circulation |
| 48 | 63 |
|
| 49 | 64 |
2009-05-13 Version 1.1 released |
| 50 | 65 |
|
| 51 | 66 |
This is the second stable release of the 1.x series. It |
| 52 | 67 |
features a better coverage of the tools available in the 0.x |
| 53 | 68 |
series, a thoroughly reworked LP/MIP interface plus various |
| 54 | 69 |
improvements in the existing tools. |
| 55 | 70 |
|
| 56 | 71 |
* Much improved M$ Windows support |
| 57 | 72 |
* Various improvements in the CMAKE build system |
| 58 | 73 |
* Compilation warnings are fixed/suppressed |
| 59 | 74 |
* Support IBM xlC compiler |
| 60 | 75 |
* New algorithms |
| 61 | 76 |
* Connectivity related algorithms (#61) |
| 62 | 77 |
* Euler walks (#65) |
| 63 | 78 |
* Preflow push-relabel max. flow algorithm (#176) |
| 64 | 79 |
* Circulation algorithm (push-relabel based) (#175) |
| 65 | 80 |
* Suurballe algorithm (#47) |
| 66 | 81 |
* Gomory-Hu algorithm (#66) |
| 67 | 82 |
* Hao-Orlin algorithm (#58) |
| 68 | 83 |
* Edmond's maximum cardinality and weighted matching algorithms |
| 69 | 84 |
in general graphs (#48,#265) |
| 70 | 85 |
* Minimum cost arborescence/branching (#60) |
| 71 | 86 |
* Network Simplex min. cost flow algorithm (#234) |
| 72 | 87 |
* New data structures |
| 73 | 88 |
* Full graph structure (#57) |
| 74 | 89 |
* Grid graph structure (#57) |
| 75 | 90 |
* Hypercube graph structure (#57) |
| 76 | 91 |
* Graph adaptors (#67) |
| 77 | 92 |
* ArcSet and EdgeSet classes (#67) |
| 78 | 93 |
* Elevator class (#174) |
| 79 | 94 |
* Other new tools |
| 80 | 95 |
* LP/MIP interface (#44) |
| 81 | 96 |
* Support for GLPK, CPLEX, Soplex, COIN-OR CLP and CBC |
| 82 | 97 |
* Reader for the Nauty file format (#55) |
| 83 | 98 |
* DIMACS readers (#167) |
| 84 | 99 |
* Radix sort algorithms (#72) |
| 85 | 100 |
* RangeIdMap and CrossRefMap (#160) |
| 86 | 101 |
* New command line tools |
| 87 | 102 |
* DIMACS to LGF converter (#182) |
| 88 | 103 |
* lgf-gen - a graph generator (#45) |
| 89 | 104 |
* DIMACS solver utility (#226) |
| 90 | 105 |
* Other code improvements |
| 91 | 106 |
* Lognormal distribution added to Random (#102) |
| 92 | 107 |
* Better (i.e. O(1) time) item counting in SmartGraph (#3) |
| 93 | 108 |
* The standard maps of graphs are guaranteed to be |
| 94 | 109 |
reference maps (#190) |
| 95 | 110 |
* Miscellaneous |
| 96 | 111 |
* Various doc improvements |
0 comments (0 inline)