Merge bugfix #444
Update INSTALL to use CMAKE. Also update AUTHORS and LICENSE
Improve module docs and references (#437)
Doc improvements for min cost flow algorithms (#437)
Fix a bug + remove redundant typedefs in dimacs-solver (#440)
Bugfix in path copy constructors and assignment operators (#444)
Fix missing initialization in CplexEnv::CplexEnv() (#445)
Bugfix in AllArcLookUp<> (#447)
Merge bugfix #447
Bugfix in adaptor_test.cc (#448)
Merge bugfix #448
Fix clang compilation warnings and errors (#449)
Merge #449 to branches >=1.2
Further clang compilation fixes (#449)
Merge #449
Further clang compilation fixes (#449)
Merge docfix #437
Merge bugfix #440
Optional iteration limit in HowardMmc (#438)
Ensure strongly polynomial running time for CycleCanceling (#436)
The number of iterations performed by Howard's algorithm is limited.
If the limit is reached, a strongly polynomial implementation,
HartmannOrlinMmc is executed to find a minimum mean cycle.
This iteration limit is typically not reached, thus the combined
method is practically equivalent to Howard's algorithm, while it
also ensures the strongly polynomial time bound.