lemon/grosso_locatelli_pullan_mc.h
changeset 1079 5958cc5c0a98
parent 918 8583fb74238c
child 1092 dceba191c00d
equal deleted inserted replaced
1:5933ad89f2dd 2:571f99a50202
    38   /// \brief Implementation of the iterated local search algorithm of Grosso,
    38   /// \brief Implementation of the iterated local search algorithm of Grosso,
    39   /// Locatelli, and Pullan for the maximum clique problem
    39   /// Locatelli, and Pullan for the maximum clique problem
    40   ///
    40   ///
    41   /// \ref GrossoLocatelliPullanMc implements the iterated local search
    41   /// \ref GrossoLocatelliPullanMc implements the iterated local search
    42   /// algorithm of Grosso, Locatelli, and Pullan for solving the \e maximum
    42   /// algorithm of Grosso, Locatelli, and Pullan for solving the \e maximum
    43   /// \e clique \e problem \ref grosso08maxclique.
    43   /// \e clique \e problem \cite grosso08maxclique.
    44   /// It is to find the largest complete subgraph (\e clique) in an
    44   /// It is to find the largest complete subgraph (\e clique) in an
    45   /// undirected graph, i.e., the largest set of nodes where each
    45   /// undirected graph, i.e., the largest set of nodes where each
    46   /// pair of nodes is connected.
    46   /// pair of nodes is connected.
    47   ///
    47   ///
    48   /// This class provides a simple but highly efficient and robust heuristic
    48   /// This class provides a simple but highly efficient and robust heuristic