contrib/CMakeLists.txt
author Peter Kovacs <kpeter@inf.elte.hu>
Thu, 15 Nov 2012 07:17:48 +0100
changeset 1179 f6f6896a4724
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.
alpar@1031
     1
INCLUDE_DIRECTORIES(
alpar@1031
     2
  ${PROJECT_SOURCE_DIR}
alpar@1031
     3
  ${PROJECT_BINARY_DIR}
alpar@1031
     4
)
alpar@1031
     5
alpar@1031
     6
LINK_DIRECTORIES(
alpar@1031
     7
  ${PROJECT_BINARY_DIR}/lemon
alpar@1031
     8
)
alpar@1031
     9
alpar@1031
    10
# Uncomment (and adjust) the following two lines. 'myprog' is the name
alpar@1031
    11
# of the final executable ('.exe' will automatically be added to the
alpar@1031
    12
# name on Windows) and 'myprog-main.cc' is the source code it is
alpar@1031
    13
# compiled from. You can add more source files separated by
alpar@1031
    14
# whitespaces. Moreover, you can add multiple similar blocks if you
alpar@1031
    15
# want to build more than one executables.
alpar@1031
    16
alpar@1031
    17
# ADD_EXECUTABLE(myprog myprog-main.cc)
alpar@1031
    18
# TARGET_LINK_LIBRARIES(myprog lemon)
alpar@1031
    19