All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
Classes | Files
Approximation Algorithms
Algorithms

Detailed Description

This group contains the approximation and heuristic algorithms implemented in LEMON.

Maximum Clique Problem

Classes

class  GrossoLocatelliPullanMc< GR >
 Implementation of the iterated local search algorithm of Grosso, Locatelli, and Pullan for the maximum clique problem. More...
 
class  GrossoLocatelliPullanMc< GR >::CliqueNodeIt
 Iterator to list the nodes of the found clique. More...
 

Files

file  grosso_locatelli_pullan_mc.h
 The iterated local search algorithm of Grosso, Locatelli, and Pullan for the maximum clique problem.