r1083:7887be87f4a0
Mon, 08 Aug 2011 13:02:26
[Not Reviewed]
0 comments (0 inline)
0
1
0
16
| 1 |
2011-08-08 Version 1.2.2 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 |
#417: Bug fix in CostScaling |
|
| 16 |
|
|
| 1 | 17 |
2010-10-21 Version 1.2.1 released |
| 2 | 18 |
|
| 3 | 19 |
Bugfix release. |
| 4 | 20 |
|
| 5 | 21 |
#366: Fix Pred[Matrix]MapPath::empty() |
| 6 | 22 |
#371: Bug fix in (di)graphCopy() |
| 7 | 23 |
The target graph is cleared before adding nodes and arcs/edges. |
| 8 | 24 |
|
| 9 | 25 |
#364: Add missing UndirectedTags |
| 10 | 26 |
#368: Fix the usage of std::numeric_limits<>::min() in Network Simplex |
| 11 | 27 |
#372: Fix a critical bug in preflow |
| 12 | 28 |
|
| 13 | 29 |
2010-03-19 Version 1.2 released |
| 14 | 30 |
|
| 15 | 31 |
This is major feature release |
| 16 | 32 |
|
| 17 | 33 |
* New algorithms |
| 18 | 34 |
* Bellman-Ford algorithm (#51) |
| 19 | 35 |
* Minimum mean cycle algorithms (#179) |
| 20 | 36 |
* Karp, Hartman-Orlin and Howard algorithms |
| 21 | 37 |
* New minimum cost flow algorithms (#180) |
| 22 | 38 |
* Cost Scaling algorithms |
| 23 | 39 |
* Capacity Scaling algorithm |
| 24 | 40 |
* Cycle-Canceling algorithms |
0 comments (0 inline)