| |
| Name | bip_cross_min.24.24.57.1 |
| Classification | nc|bc|d2 |
| Problem type | quadratic_linear_ordering |
| Description | edge-crossing minimization in bipartite graphs modeled as a quadratic linear ordering problem |
| |
| Objective sense | min |
| Variables | 553 (552 binary, 0 general integer, 1 continuous) |
| Nonlinear variables | 1 |
| Constraints | 8096 |
| Nonlinear constraints | 1 |
| Linear nonzeros | 24288 |
| Nonlinear nonzeros | 1821 |
| |
| Download | bip_cross_min.24.24.57.1.pip.gz bip_cross_min.24.24.57.1.gms.gz bip_cross_min.24.24.57.1.mod.gz bip_cross_min.24.24.57.1.zpl.gz |
| Best known solution | |
| Best known objective | |
| Best known bound | |
| |
| Originator | Christoph Buchheim, Angelika Wiegele, Lanbo Zheng |
| Formulator | Ulrike Pagacz |
| Donator | Christoph Buchheim |
| |
| References |
|
bip_cross_min.24.24.57.1