Benchmark Instances

  1. Graph Coloring and its Generalizations.
  2. Clique.
  3. Vertex Cover.
  4. Degree Constrainned Spanning Tree.
  5. Graph Partitioning.
  6. Traveling Salesman Problem.
  7. Quadratic Assignment.
This website is maintained by ThanhVu H. Nguyen (tnguyen at cs.unm.edu) and Thang Bui (tbui at psu.edu)