POLIP

library for polynomially constrained
mixed-integer programming


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

Easy  data_2pm_77_777.dimacs

Namedata_2pm_77_777.dimacs
Classificationnc|bc|d2
Problem typegraphpart
DescriptionQuadratic model for graph partitioning instance data_2pm_77_777.dimacs
Objective sensemin
Variables148  (147 binary, 0 general integer, 1 continuous)
Nonlinear variables1
Constraints49
Nonlinear constraints1
Linear nonzeros99
Nonlinear nonzeros295
Download data_2pm_77_777.dimacs.pip.gz data_2pm_77_777.dimacs.gms.gz data_2pm_77_777.dimacs.mod.gz data_2pm_77_777.dimacs.zpl.gz
Best known solution
Best known objective-40
Best known bound-40
OriginatorBissan Ghaddar, Miguel Anjos, and Frauke Liers
FormulatorMarc Pfetsch
DonatorMarc Pfetsch
References