This repository of benchmark instances for the maximum weight clique problem accompanies the paper On Maximum Weight Clique Algorithms, and How They Are Evaluated by Ciaran McCreesh, Patrick Prosser, Kyle Simpson and James Trimble (CP 2017, forthcoming).

All graphs are in DIMACS (ASCII, undirected) format. For example, a file with the following contents would represent a graph with four vertices with weights 10, 11, 12, 13 and a single edge from the first vertex to the second vertex.

p edge 4 1
n 1 10
n 2 11
n 3 12
n 4 13
e 1 2

The UAI instances were kindly contributed by Hong Xu. Note that these are maximum weight independent set instances.

We hope to add further sets of instances over time. Please contact j.trimble.1@research.glasgow.ac.uk if you have any suggestions.