COIN-OR::LEMON - Graph Library

Changeset 999:c279b19abc62 in lemon


Ignore:
Timestamp:
07/23/10 06:29:37 (9 years ago)
Author:
Peter Kovacs <kpeter@…>
Branch:
default
Phase:
public
Message:

Add a heuristic algorithm for the max clique problem (#380)

Files:
2 added
5 edited

Legend:

Unmodified
Added
Removed
  • doc/groups.dox

    r959 r999  
    552552
    553553/**
    554 @defgroup approx Approximation Algorithms
     554@defgroup approx_algs Approximation Algorithms
    555555@ingroup algs
    556556\brief Approximation algorithms.
     
    558558This group contains the approximation and heuristic algorithms
    559559implemented in LEMON.
     560
     561<b>Maximum Clique Problem</b>
     562  - \ref GrossoLocatelliPullanMc An efficient heuristic algorithm of
     563    Grosso, Locatelli, and Pullan.
    560564*/
    561565
  • doc/references.bib

    r802 r999  
    298298  address =      {Dublin, Ireland},
    299299  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

    r953 r999  
    9191        lemon/graph_to_eps.h \
    9292        lemon/grid_graph.h \
     93        lemon/grosso_locatelli_pullan_mc.h \
    9394        lemon/hartmann_orlin_mmc.h \
    9495        lemon/howard_mmc.h \
  • test/CMakeLists.txt

    r953 r999  
    3232  maps_test
    3333  matching_test
     34  max_clique_test
    3435  min_cost_arborescence_test
    3536  min_cost_flow_test
  • test/Makefile.am

    r953 r999  
    3434        test/maps_test \
    3535        test/matching_test \
     36        test/max_clique_test \
    3637        test/min_cost_arborescence_test \
    3738        test/min_cost_flow_test \
     
    8586test_mip_test_SOURCES = test/mip_test.cc
    8687test_matching_test_SOURCES = test/matching_test.cc
     88test_max_clique_test_SOURCES = test/max_clique_test.cc
    8789test_min_cost_arborescence_test_SOURCES = test/min_cost_arborescence_test.cc
    8890test_min_cost_flow_test_SOURCES = test/min_cost_flow_test.cc
Note: See TracChangeset for help on using the changeset viewer.