POLIP

library for polynomially constrained
mixed-integer programming


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

Easy  data_3pm_244_244.dimacs

Namedata_3pm_244_244.dimacs
Classificationnc|bc|d2
Problem typegraphpart
DescriptionQuadratic model for graph partitioning instance data_3pm_244_244.dimacs
Objective sensemin
Variables97  (96 binary, 0 general integer, 1 continuous)
Nonlinear variables1
Constraints32
Nonlinear constraints1
Linear nonzeros65
Nonlinear nonzeros241
Download data_3pm_244_244.dimacs.pip.gz data_3pm_244_244.dimacs.gms.gz data_3pm_244_244.dimacs.mod.gz data_3pm_244_244.dimacs.zpl.gz
Best known solution
Best known objective-31
Best known bound-31
OriginatorBissan Ghaddar, Miguel Anjos, and Frauke Liers
FormulatorMarc Pfetsch
DonatorMarc Pfetsch
References