Approximation Algorithms

Detailed Description

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

Maximum Clique Problem

• GrossoLocatelliPullanMc An efficient heuristic algorithm of Grosso, Locatelli, and Pullan.

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.