POLIP

library for polynomially constrained
mixed-integer programming


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

Hard  data_3g_334_334.dimacs

Namedata_3g_334_334.dimacs
Classificationnc|bc|d2
Problem typegraphpart
DescriptionQuadratic model for graph partitioning instance data_3g_334_334.dimacs
Objective sensemin
Variables109  (108 binary, 0 general integer, 1 continuous)
Nonlinear variables1
Constraints36
Nonlinear constraints1
Linear nonzeros73
Nonlinear nonzeros325
Download data_3g_334_334.dimacs.pip.gz data_3g_334_334.dimacs.gms.gz data_3g_334_334.dimacs.mod.gz data_3g_334_334.dimacs.zpl.gz
Best known solution
Best known objective-3410696
Best known bound-3410696
OriginatorBissan Ghaddar, Miguel Anjos, and Frauke Liers
FormulatorMarc Pfetsch
DonatorMarc Pfetsch
References