cmake/nsis/lemon.ico
| author |
Peter Kovacs <kpeter@inf.elte.hu> |
|
Thu, 15 Nov 2012 07:17:48 +0100 |
| changeset 1013 |
f6f6896a4724 |
| parent 225 |
c5a40fc54f1a
|
| permissions |
-rw-r--r-- |
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.