Benchmark Data for the Paper:
New Integer Linear Programming Models for the Vertex Coloring Problem
by Adalat Jabrayilov and Petra Mutzel
popbenchmark.zip Graph-Coloring-Benchmark: 68 Dimacs + 340 Random G(n,p) instances
Source-Code of ILP Models
vcp_source_code.zip The Source-Codes of the simple Integer Linear Programs POP, POP2, ASS+c, ASS+e, REP and AREP