library for polynomially constrained
mixed-integer programming

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

Hard  t2g20_5555

Problem typemaxcut
DescriptionQuadratic model for the max-cut instance t2g20_5555
Objective sensemax
Variables401  (400 binary, 0 general integer, 1 continuous)
Nonlinear variables401
Nonlinear constraints1
Linear nonzeros0
Nonlinear nonzeros1201
Download t2g20_5555.pip.gz t2g20_5555.gms.gz t2g20_5555.mod.gz t2g20_5555.zpl.gz
Best known solution
Best known objective24838942
Best known bound24838942
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