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... | |
| Files | |
| file | grosso_locatelli_pullan_mc.h | 
| The iterated local search algorithm of Grosso, Locatelli, and Pullan for the maximum clique problem. | |
 1.8.5
 1.8.5