POLIP

library for polynomially constrained
mixed-integer programming


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

Easy  data_2pm_66_66.dimacs

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