POLIP

library for polynomially constrained
mixed-integer programming


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

Hard  data_2g_1010_824.dimacs

Namedata_2g_1010_824.dimacs
Classificationnc|bc|d2
Problem typegraphpart
DescriptionQuadratic model for graph partitioning instance data_2g_1010_824.dimacs
Objective sensemin
Variables301  (300 binary, 0 general integer, 1 continuous)
Nonlinear variables1
Constraints100
Nonlinear constraints1
Linear nonzeros201
Nonlinear nonzeros601
Download data_2g_1010_824.dimacs.pip.gz data_2g_1010_824.dimacs.gms.gz data_2g_1010_824.dimacs.mod.gz data_2g_1010_824.dimacs.zpl.gz
Best known solution
Best known objective-7024864
Best known bound-7024864
OriginatorBissan Ghaddar, Miguel Anjos, and Frauke Liers
FormulatorMarc Pfetsch
DonatorMarc Pfetsch
References