Changes in / [903:3ffd46dc8e01:905:de428ebb47ab] in lemon-main
- Files:
-
- 2 added
- 5 edited
Legend:
- Unmodified
- Added
- Removed
-
doc/groups.dox
r879 r904 552 552 553 553 /** 554 @defgroup approx Approximation Algorithms554 @defgroup approx_algs Approximation Algorithms 555 555 @ingroup algs 556 556 \brief Approximation algorithms. … … 558 558 This group contains the approximation and heuristic algorithms 559 559 implemented in LEMON. 560 561 <b>Maximum Clique Problem</b> 562 - \ref GrossoLocatelliPullanMc An efficient heuristic algorithm of 563 Grosso, Locatelli, and Pullan. 560 564 */ 561 565 -
doc/references.bib
r755 r904 298 298 address = {Dublin, Ireland}, 299 299 year = 1991, 300 month = sep, 301 } 300 month = sep 301 } 302 303 %%%%% Other algorithms %%%%% 304 305 @article{grosso08maxclique, 306 author = {Andrea Grosso and Marco Locatelli and Wayne Pullan}, 307 title = {Simple ingredients leading to very efficient 308 heuristics for the maximum clique problem}, 309 journal = {Journal of Heuristics}, 310 year = 2008, 311 volume = 14, 312 number = 6, 313 pages = {587--612} 314 } -
lemon/Makefile.am
r874 r904 91 91 lemon/graph_to_eps.h \ 92 92 lemon/grid_graph.h \ 93 lemon/grosso_locatelli_pullan_mc.h \ 93 94 lemon/hartmann_orlin_mmc.h \ 94 95 lemon/howard_mmc.h \ -
test/CMakeLists.txt
r901 r905 32 32 maps_test 33 33 matching_test 34 max_clique_test 34 35 min_cost_arborescence_test 35 36 min_cost_flow_test -
test/Makefile.am
r874 r904 34 34 test/maps_test \ 35 35 test/matching_test \ 36 test/max_clique_test \ 36 37 test/min_cost_arborescence_test \ 37 38 test/min_cost_flow_test \ … … 85 86 test_mip_test_SOURCES = test/mip_test.cc 86 87 test_matching_test_SOURCES = test/matching_test.cc 88 test_max_clique_test_SOURCES = test/max_clique_test.cc 87 89 test_min_cost_arborescence_test_SOURCES = test/min_cost_arborescence_test.cc 88 90 test_min_cost_flow_test_SOURCES = test/min_cost_flow_test.cc
Note: See TracChangeset
for help on using the changeset viewer.