 
Name  data_2g_66_66.dimacs 
Classification  ncbcd2 
Problem type  graphpart 
Description  Quadratic model for graph partitioning instance data_2g_66_66.dimacs 
 
Objective sense  min 
Variables  109 (108 binary, 0 general integer, 1 continuous) 
Nonlinear variables  1 
Constraints  36 
Nonlinear constraints  1 
Linear nonzeros  73 
Nonlinear nonzeros  217 
 
Download  data_2g_66_66.dimacs.pip.gz data_2g_66_66.dimacs.gms.gz data_2g_66_66.dimacs.mod.gz data_2g_66_66.dimacs.zpl.gz 
Best known solution  
Best known objective  2865560 
Best known bound  2865560 
 
Originator  Bissan Ghaddar, Miguel Anjos, and Frauke Liers 
Formulator  Marc Pfetsch 
Donator  Marc Pfetsch 
 
References 
GhaddarAnjosLiers09

Links 

 
Additional information  This is a quadratic model for the graph partitioning problem. The
graphs are taken from the publication of Ghaddar et al. We used 3
parts of the partition to generate the quadratic instances. The model
assigns each node to one of the three parts. Hence, the model is
symmetric, which should probably be used in a solution algorithm.

 