Release Notes: The TSP branch and bound code was revised. This has improved the performance of the symmetric TSP code, and the ATSP code was debugged. Now one can display Hamiltonian cycles, color classes, and node orderings by a circular layout method.
Release Notes: Several bugs in the min-cost flow solver have been fixed. A multi-terminal variant of the shortest augmenting path method has been added. The GUI has also been revised (alignment of slave windows and synchronisation of the label editor with other GUI functionality).
Release Notes: The matching code has been debugged extensively. Some GUI defects have been fixed.
Release Notes: A couple of bugs have been fixed, mainly in the network flow solvers. An excess scaling implementation of the max-flow preflow-push method was added.
Release Notes: The source code now compiles with gcc 3.4.x.
Release Notes: The GUI and the library now support progress counting and estimation of execution times. To the GUI, context menus for the graph display and the messenger have been added. Several bugs have been fixed.
Release Notes: The stable set and node colouring code has been revised, which improved performance. The GUI now does file I/O in a separate thread.
Release Notes: Now, an initial branch&bound code for mixed integer programming is available. The display of LPs and trees has been refined. Some GUI bugs regarding trace file display and export have been fixed.
Release Notes: The documentation has been updated. The display of right-hand input forms has been cleaned up. Several bugs in the weighted matching code have been fixed.
Release Notes: Among other code cleanup steps, the Makefile was revised to ease the generation of binary packages. A lot of GUI problems has been fixed, especially with the Cygwin version. A self-installing, up to date Win32 version is now available.