Mercuriallemon-main / file revision
summary | shortlog | changelog | graph | tags | bookmarks | branches | files | changeset | file | latest | revisions | annotate | diff | comparison | raw | help
tools/CMakeLists.txt
author Peter Kovacs <kpeter@inf.elte.hu>
Thu, 15 Nov 2012 07:17:48 +0100
changeset 1013 f6f6896a4724
parent 549 ba659d676331
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. 
     1 INCLUDE_DIRECTORIES(

     2   ${PROJECT_SOURCE_DIR}

     3   ${PROJECT_BINARY_DIR}

     4 )

     5 

     6 LINK_DIRECTORIES(

     7   ${PROJECT_BINARY_DIR}/lemon

     8 )

     9 

    10 ADD_EXECUTABLE(lgf-gen lgf-gen.cc)

    11 TARGET_LINK_LIBRARIES(lgf-gen lemon)

    12 

    13 ADD_EXECUTABLE(dimacs-to-lgf dimacs-to-lgf.cc)

    14 TARGET_LINK_LIBRARIES(dimacs-to-lgf lemon)

    15 

    16 ADD_EXECUTABLE(dimacs-solver dimacs-solver.cc)

    17 TARGET_LINK_LIBRARIES(dimacs-solver lemon)

    18 

    19 INSTALL(

    20   TARGETS lgf-gen dimacs-to-lgf dimacs-solver

    21   RUNTIME DESTINATION bin

    22   COMPONENT bin

    23 )

    24 

    25 IF(NOT WIN32)

    26   INSTALL(

    27     PROGRAMS ${CMAKE_CURRENT_SOURCE_DIR}/lemon-0.x-to-1.x.sh

    28     DESTINATION bin

    29     COMPONENT bin

    30   )

    31 ENDIF()
lemon-main