POLIP

library for polynomially constrained
mixed-integer programming


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

Easy  data_2pm_55_55.dimacs

Namedata_2pm_55_55.dimacs
Classificationnc|bc|d2
Problem typegraphpart
DescriptionQuadratic model for graph partitioning instance data_2pm_55_55.dimacs
Objective sensemin
Variables76  (75 binary, 0 general integer, 1 continuous)
Nonlinear variables1
Constraints25
Nonlinear constraints1
Linear nonzeros51
Nonlinear nonzeros151
Download data_2pm_55_55.dimacs.pip.gz data_2pm_55_55.dimacs.gms.gz data_2pm_55_55.dimacs.mod.gz data_2pm_55_55.dimacs.zpl.gz
Best known solution
Best known objective-20
Best known bound-20
OriginatorBissan Ghaddar, Miguel Anjos, and Frauke Liers
FormulatorMarc Pfetsch
DonatorMarc Pfetsch
References