library for polynomially constrained
mixed-integer programming

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

Hard  ising3.0-100_5555

Problem typemaxcut
DescriptionQuadratic model for the max-cut instance ising3.0-100_5555
Objective sensemax
Variables101  (100 binary, 0 general integer, 1 continuous)
Nonlinear variables101
Nonlinear constraints1
Linear nonzeros0
Nonlinear nonzeros4676
Download ising3.0-100_5555.pip.gz ising3.0-100_5555.gms.gz ising3.0-100_5555.mod.gz ising3.0-100_5555.zpl.gz
Best known solution
Best known objective2448189
Best known bound2448189
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