POLIP

library for polynomially constrained
mixed-integer programming


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

Hard  data_2pm_99_999.dimacs

Namedata_2pm_99_999.dimacs
Classificationnc|bc|d2
Problem typegraphpart
DescriptionQuadratic model for graph partitioning instance data_2pm_99_999.dimacs
Objective sensemin
Variables244  (243 binary, 0 general integer, 1 continuous)
Nonlinear variables1
Constraints81
Nonlinear constraints1
Linear nonzeros163
Nonlinear nonzeros487
Download data_2pm_99_999.dimacs.pip.gz data_2pm_99_999.dimacs.gms.gz data_2pm_99_999.dimacs.mod.gz data_2pm_99_999.dimacs.zpl.gz
Best known solution
Best known objective-65
Best known bound-65
OriginatorBissan Ghaddar, Miguel Anjos, and Frauke Liers
FormulatorMarc Pfetsch
DonatorMarc Pfetsch
References GhaddarAnjosLiers09
Links
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