Large-scale Complete Graph Instances for Max-Cut Problem

There are 180 large-scale high-density (97-99%) instances for Max-Cut problems with Q matrix from 1000 by 1000 to 90000 by 90000. For 90000 by 90000, the file are broken to multiple 2GB pieces such as MC90000_*.txt.gz_a, ...MC90000_*.txt.gz.d .<br>
To recover the large data file after you download the pieces, use<br>
copy /b file1 + file2 + file3 + file4 filetogether <br>
for example, for MC90000_1.txt data<br>
copy /b MC90000_1.txt.gz_a +....+ MC90000_1.txt.gz_e MC90000_1.txt.gz<br>
gunzip MC90000_1.txt.gz
<br>
There are three different types of weights on the instances. The MCxx_yy_a.txt.xz instance has 1 and -1 weight. The MCxx_yy_b.txt.xz instance has random value between -10 and 10. The MCxx_yy_c.txt.xz instance has random value between -1000 and 1000. All data files are compressed with XZ tool.
<br>
For each instance, there is a text-file in the following format (rudy-output format):
<br>
n m<br>
h_1 t_1 c_{h_1,t_1}<br>
h_2 t_2 c_{h_2,t_2}<br>
...<br>
h_n t_n c_{h_n,t_n}<br>
<br>
where n is the number of nodes, m the number of edges and for each edge, h_i and t_i are the end-nodes and c_{h_i,t_i} the weight. Nodes are numbered from 1 up to n.
All instances are generated as complete graph