POLIP

library for polynomially constrained
mixed-integer programming


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

Easy  data_2pm_44_44.dimacs

Namedata_2pm_44_44.dimacs
Classificationnc|bc|d2
Problem typegraphpart
DescriptionQuadratic model for graph partitioning instance data_2pm_44_44.dimacs
Objective sensemin
Variables49  (48 binary, 0 general integer, 1 continuous)
Nonlinear variables1
Constraints16
Nonlinear constraints1
Linear nonzeros33
Nonlinear nonzeros97
Download data_2pm_44_44.dimacs.pip.gz data_2pm_44_44.dimacs.gms.gz data_2pm_44_44.dimacs.mod.gz data_2pm_44_44.dimacs.zpl.gz
Best known solution
Best known objective-13
Best known bound-13
OriginatorBissan Ghaddar, Miguel Anjos, and Frauke Liers
FormulatorMarc Pfetsch
DonatorMarc Pfetsch
References