Short communication: a larger clique for a DIMACS test

  • Andrea Grosso
  • Marco Locatelli
  • Wayne J. Pullan
    • Categories Combinatorial Optimization Tags , , Short URL: https://optimization-online.org/?p=9690

    In the DIMACS benchmark suite for the maximum clique problem, the best known solution for test C2000.9 is a 78 nodes clique; optimality is not proved. We present a 79 nodes clique emerged during the testing of a heuristic algorithm.

    Article

    Download

    View PDF