POLIP

library for polynomially constrained
mixed-integer programming


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

Easy  data_3pm_333_333.dimacs

Namedata_3pm_333_333.dimacs
Classificationnc|bc|d2
Problem typegraphpart
DescriptionQuadratic model for graph partitioning instance data_3pm_333_333.dimacs
Objective sensemin
Variables82  (81 binary, 0 general integer, 1 continuous)
Nonlinear variables1
Constraints27
Nonlinear constraints1
Linear nonzeros55
Nonlinear nonzeros244
Download data_3pm_333_333.dimacs.pip.gz data_3pm_333_333.dimacs.gms.gz data_3pm_333_333.dimacs.mod.gz data_3pm_333_333.dimacs.zpl.gz
Best known solution
Best known objective-26
Best known bound-26
OriginatorBissan Ghaddar, Miguel Anjos, and Frauke Liers
FormulatorMarc Pfetsch
DonatorMarc Pfetsch
References