COIN-OR::LEMON - Graph Library

Changeset 904:c279b19abc62 in lemon-main for doc/groups.dox


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

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

File:
1 edited

Legend:

Unmodified
Added
Removed
  • doc/groups.dox

    r879 r904  
    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
Note: See TracChangeset for help on using the changeset viewer.