tools/CMakeLists.txt
author Peter Kovacs <kpeter@inf.elte.hu>
Fri, 17 Apr 2009 18:04:36 +0200
changeset 656 e6927fe719e6
child 596 ba659d676331
permissions -rw-r--r--
Support >= and <= constraints in NetworkSimplex (#219, #234)

By default the same inequality constraints are supported as by
Circulation (the GEQ form), but the LEQ form can also be selected
using the problemType() function.

The documentation of the min. cost flow module is reworked and
extended with important notes and explanations about the different
variants of the problem and about the dual solution and optimality
conditions.
alpar@574
     1
INCLUDE_DIRECTORIES(
alpar@574
     2
  ${CMAKE_SOURCE_DIR}
alpar@574
     3
  ${CMAKE_BINARY_DIR}
alpar@574
     4
)
alpar@574
     5
alpar@574
     6
LINK_DIRECTORIES(${CMAKE_BINARY_DIR}/lemon)
alpar@574
     7
alpar@574
     8
ADD_EXECUTABLE(lgf-gen lgf-gen.cc)
alpar@574
     9
TARGET_LINK_LIBRARIES(lgf-gen lemon)
alpar@574
    10
alpar@574
    11
ADD_EXECUTABLE(dimacs-to-lgf dimacs-to-lgf.cc)
alpar@574
    12
TARGET_LINK_LIBRARIES(dimacs-to-lgf lemon)
alpar@574
    13
alpar@574
    14
ADD_EXECUTABLE(dimacs-solver dimacs-solver.cc)
alpar@574
    15
TARGET_LINK_LIBRARIES(dimacs-solver lemon)
alpar@574
    16
alpar@574
    17
INSTALL(
alpar@574
    18
  TARGETS lgf-gen dimacs-to-lgf dimacs-solver
alpar@574
    19
  RUNTIME DESTINATION bin
alpar@574
    20
  COMPONENT bin
alpar@574
    21
)
alpar@574
    22
alpar@574
    23
IF(NOT WIN32)
alpar@574
    24
  INSTALL(
alpar@574
    25
    FILES ${CMAKE_CURRENT_SOURCE_DIR}/lemon-0.x-to-1.x.sh
alpar@574
    26
    RUNTIME DESTINATION bin
alpar@574
    27
    COMPONENT bin)
alpar@574
    28
ENDIF(NOT WIN32)