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.

 prefix=@CMAKE_INSTALL_PREFIX@

 exec_prefix=@CMAKE_INSTALL_PREFIX@/bin

 libdir=@CMAKE_INSTALL_PREFIX@/lib

 includedir=@CMAKE_INSTALL_PREFIX@/include

 Name: @PROJECT_NAME@

 Description: Library for Efficient Modeling and Optimization in Networks

 Version: @PROJECT_VERSION@

 Libs: -L${libdir} -lemon @GLPK_LIBS@ @CPLEX_LIBS@ @SOPLEX_LIBS@ @CLP_LIBS@ @CBC_LIBS@

 Cflags: -I${includedir}