library for polynomially constrained
mixed-integer programming

polip :: contents / contributors / instances / archive / bibliography

Hard  data_3g_244_244.dimacs

Problem typegraphpart
DescriptionQuadratic model for graph partitioning instance data_3g_244_244.dimacs
Objective sensemin
Variables97  (96 binary, 0 general integer, 1 continuous)
Nonlinear variables1
Nonlinear constraints1
Linear nonzeros65
Nonlinear nonzeros241
Download data_3g_244_244.dimacs.pip.gz data_3g_244_244.dimacs.gms.gz data_3g_244_244.dimacs.mod.gz data_3g_244_244.dimacs.zpl.gz
Best known solution
Best known objective-2510946
Best known bound-2510946
OriginatorBissan Ghaddar, Miguel Anjos, and Frauke Liers
FormulatorMarc Pfetsch
DonatorMarc Pfetsch
References GhaddarAnjosLiers09
Additional informationThis 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.

© by maintainers  |     |  imprint