POLIP

library for polynomially constrained
mixed-integer programming


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

Hard  data_clique_50.dimacs

Namedata_clique_50.dimacs
Classificationnc|bc|d2
Problem typegraphpart
DescriptionQuadratic model for graph partitioning instance data_clique_50.dimacs
Objective sensemin
Variables151  (150 binary, 0 general integer, 1 continuous)
Nonlinear variables1
Constraints50
Nonlinear constraints1
Linear nonzeros101
Nonlinear nonzeros3676
Download data_clique_50.dimacs.pip.gz data_clique_50.dimacs.gms.gz data_clique_50.dimacs.mod.gz data_clique_50.dimacs.zpl.gz
Best known solution
Best known objective2312
Best known bound2312
OriginatorBissan Ghaddar, Miguel Anjos, and Frauke Liers
FormulatorMarc Pfetsch
DonatorMarc Pfetsch
References