Approximation Algorithms

- Main Page
- Modules
- Classes
- Namespaces
- Files
- Related Pages

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
Classes | Files
Approximation Algorithms
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...

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