bip_cross_min.20.20.40.1
POLIPlibrary for polynomially constrained
| ||
bip_cross_min.20.20.40.1| Name | bip_cross_min.20.20.40.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 | 381 (380 binary, 0 general integer, 1 continuous) |
| Nonlinear variables | 1 |
| Constraints | 4560 |
| Nonlinear constraints | 1 |
| Linear nonzeros | 13680 |
| Nonlinear nonzeros | 965 |
| Download | bip_cross_min.20.20.40.1.pip.gz bip_cross_min.20.20.40.1.gms.gz bip_cross_min.20.20.40.1.mod.gz bip_cross_min.20.20.40.1.zpl.gz |
| Best known solution | bip_cross_min.20.20.40.1.sol.gz |
| Best known objective | 57 |
| Best known bound | 57 |
| Originator | Christoph Buchheim, Angelika Wiegele, Lanbo Zheng |
| Formulator | Ulrike Pagacz |
| Donator | Christoph Buchheim |
| References |