Optimization Online


Short communication: a larger clique for a DIMACS test

Andrea Grosso (grosso***at***di.unito.it)
Marco Locatelli (locatell***at***di.unito.it)
Wayne, J. Pullan (w.pullan***at***griffith.edu.au)

Abstract: 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.

Keywords: Maximum clique problem, DIMACS tests, heuristic algorithms

Category 1: Combinatorial Optimization


Download: [PDF]

Entry Submitted: 01/31/2005
Entry Accepted: 02/01/2005
Entry Last Modified: 03/29/2005

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society