POLIP

library for polynomially constrained
mixed-integer programming


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

Hard  data_clique_40.dimacs

Namedata_clique_40.dimacs
Classificationnc|bc|d2
Problem typegraphpart
DescriptionQuadratic model for graph partitioning instance data_clique_40.dimacs
Objective sensemin
Variables121  (120 binary, 0 general integer, 1 continuous)
Nonlinear variables1
Constraints40
Nonlinear constraints1
Linear nonzeros81
Nonlinear nonzeros2341
Download data_clique_40.dimacs.pip.gz data_clique_40.dimacs.gms.gz data_clique_40.dimacs.mod.gz data_clique_40.dimacs.zpl.gz
Best known solution
Best known objective1183
Best known bound1183
OriginatorBissan Ghaddar, Miguel Anjos, and Frauke Liers
FormulatorMarc Pfetsch
DonatorMarc Pfetsch
References