library for polynomially constrained
mixed-integer programming

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

Easy  data_clique_30.dimacs

Problem typegraphpart
DescriptionQuadratic model for graph partitioning instance data_clique_30.dimacs
Objective sensemin
Variables91  (90 binary, 0 general integer, 1 continuous)
Nonlinear variables1
Nonlinear constraints1
Linear nonzeros61
Nonlinear nonzeros1306
Download data_clique_30.dimacs.pip.gz data_clique_30.dimacs.gms.gz data_clique_30.dimacs.mod.gz data_clique_30.dimacs.zpl.gz
Best known solution
Best known objective495
Best known bound495
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