ising3.0-100_5555
POLIPlibrary for polynomially constrained
| ||
ising3.0-100_5555| Name | ising3.0-100_5555 |
| Classification | nc|bc|d2 |
| Problem type | maxcut |
| Description | Quadratic model for the max-cut instance ising3.0-100_5555 |
| Objective sense | max |
| Variables | 101 (100 binary, 0 general integer, 1 continuous) |
| Nonlinear variables | 101 |
| Constraints | 0 |
| Nonlinear constraints | 1 |
| Linear nonzeros | 0 |
| Nonlinear nonzeros | 4676 |
| 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 objective | 2448189 |
| Best known bound | 2448189 |
| Originator | graph from Biq Mac web page |
| Formulator | Marc Pfetsch |
| Donator | Marc Pfetsch |
| References | RendlRinaldiWiegele2010 Wiegele2006 |
| Links | Biq Mac web page |
| Additional information | This is a quadratic model for the max-cut problem. The graphs are taken from the Biq Mac web page
|
© by maintainers | | imprint