data_clique_40.dimacs
POLIPlibrary for polynomially constrained
| ||
data_clique_40.dimacs| Name | data_clique_40.dimacs |
| Classification | nc|bc|d2 |
| Problem type | graphpart |
| Description | Quadratic model for graph partitioning instance data_clique_40.dimacs |
| Objective sense | min |
| Variables | 121 (120 binary, 0 general integer, 1 continuous) |
| Nonlinear variables | 1 |
| Constraints | 40 |
| Nonlinear constraints | 1 |
| Linear nonzeros | 81 |
| Nonlinear nonzeros | 2341 |
| Download | data_clique_40.dimacs.pip.gz data_clique_40.dimacs.gms.gz data_clique_40.dimacs.mod.gz data_clique_40.dimacs.zpl.gz |
| Best known solution | |
| Best known objective | 1183 |
| Best known bound | 1183 |
| Originator | Bissan Ghaddar, Miguel Anjos, and Frauke Liers |
| Formulator | Marc Pfetsch |
| Donator | Marc Pfetsch |
| References | GhaddarAnjosLiers09 |
| Links | |
| Additional information | This is a quadratic model for the graph partitioning problem. The
graphs are taken from the publication of Ghaddar et al. We used 3
parts of the partition to generate the quadratic instances. The model
assigns each node to one of the three parts. Hence, the model is
symmetric, which should probably be used in a solution algorithm.
|
© by maintainers | | imprint