library for polynomially constrained
mixed-integer programming

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

Hard  t3g6_5555

Problem typemaxcut
DescriptionQuadratic model for the max-cut instance t3g6_5555
Objective sensemax
Variables217  (216 binary, 0 general integer, 1 continuous)
Nonlinear variables217
Nonlinear constraints1
Linear nonzeros0
Nonlinear nonzeros865
Download t3g6_5555.pip.gz t3g6_5555.gms.gz t3g6_5555.mod.gz t3g6_5555.zpl.gz
Best known solution
Best known objective17434469
Best known bound17434469
Originatorgraph from Biq Mac web page
FormulatorMarc Pfetsch
DonatorMarc Pfetsch
References RendlRinaldiWiegele2010 Wiegele2006
Links Biq Mac web page
Additional informationThis is a quadratic model for the max-cut problem. The graphs are taken from the Biq Mac web page

© by maintainers  |     |  imprint