library for polynomially constrained
mixed-integer programming

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

Hard  data_2g_66_66.dimacs

Problem typegraphpart
DescriptionQuadratic model for graph partitioning instance data_2g_66_66.dimacs
Objective sensemin
Variables109  (108 binary, 0 general integer, 1 continuous)
Nonlinear variables1
Nonlinear constraints1
Linear nonzeros73
Nonlinear nonzeros217
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
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