Changeset 1200:62ba43576f85 in lemon
 Timestamp:
 01/08/11 22:49:09 (9 years ago)
 Branch:
 default
 Phase:
 public
 Location:
 doc
 Files:

 1 added
 3 edited
Legend:
 Unmodified
 Added
 Removed

doc/CMakeLists.txt
r1016 r1200 32 32 COMMAND ${GHOSTSCRIPT_EXECUTABLE} ${GHOSTSCRIPT_OPTIONS} r18 sOutputFile=genimages/planar.png ${CMAKE_CURRENT_SOURCE_DIR}/images/planar.eps 33 33 COMMAND ${GHOSTSCRIPT_EXECUTABLE} ${GHOSTSCRIPT_OPTIONS} r18 sOutputFile=genimages/strongly_connected_components.png ${CMAKE_CURRENT_SOURCE_DIR}/images/strongly_connected_components.eps 34 COMMAND ${GHOSTSCRIPT_EXECUTABLE} ${GHOSTSCRIPT_OPTIONS} r18 sOutputFile=genimages/tsp.png ${CMAKE_CURRENT_SOURCE_DIR}/images/tsp.eps 34 35 COMMAND ${CMAKE_COMMAND} E remove_directory html 35 36 COMMAND ${PYTHON_EXECUTABLE} ${PROJECT_SOURCE_DIR}/scripts/bib2dox.py ${CMAKE_CURRENT_SOURCE_DIR}/references.bib >references.dox 
doc/Makefile.am
r943 r1200 31 31 node_biconnected_components.eps \ 32 32 planar.eps \ 33 strongly_connected_components.eps 33 strongly_connected_components.eps \ 34 tsp.eps 34 35 35 36 DOC_EPS_IMAGES = \ 
doc/groups.dox
r999 r1200 550 550 \image latex planar.eps "Plane graph" width=\textwidth 551 551 */ 552 553 /** 554 @defgroup tsp Traveling Salesman Problem 555 @ingroup algs 556 \brief Algorithms for the symmetric traveling salesman problem 557 558 This group contains basic heuristic algorithms for the the symmetric 559 \e traveling \e salesman \e problem (TSP). 560 Given an \ref FullGraph "undirected full graph" with a cost map on its edges, 561 the problem is to find a shortest possible tour that visits each node exactly 562 once (i.e. the minimum cost Hamiltonian cycle). 563 564 These TSP algorithms should be used with a 565 metric cost function. Otherwise, they could yield worse results. 566 567 LEMON provides five wellknown heuristics for solving symmetric TSP: 568  \ref NearestNeighborTsp Neareast neighbor algorithm 569  \ref GreedyTsp Greedy algorithm 570  \ref InsertionTsp Insertion heuristic (with four selection methods) 571  \ref ChristofidesTsp Christofides algorithm 572  \ref Opt2Tsp 2opt algorithm 573 574 \image html tsp.png 575 \image latex tsp.eps "Traveling salesman problem" width=\textwidth 576 */ 552 577 553 578 /**
Note: See TracChangeset
for help on using the changeset viewer.