POLIP

library for polynomially constrained
mixed-integer programming

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

Hard  bip_cross_min.14.14.98.1

Namebip_cross_min.14.14.98.1
Classificationnc|bc|d2
Problem typequadratic_linear_ordering
Descriptionedge-crossing minimization in bipartite graphs modeled as a quadratic linear ordering problem
Objective sensemin
Variables183  (182 binary, 0 general integer, 1 continuous)
Nonlinear variables1
Constraints1456
Nonlinear constraints1
Linear nonzeros4368
Nonlinear nonzeros3125
Download bip_cross_min.14.14.98.1.pip.gz bip_cross_min.14.14.98.1.gms.gz bip_cross_min.14.14.98.1.mod.gz bip_cross_min.14.14.98.1.zpl.gz
Best known solutionbip_cross_min.14.14.98.1.sol.gz
Best known objective1355
Best known bound1355
OriginatorChristoph Buchheim, Angelika Wiegele, Lanbo Zheng
FormulatorUlrike Pagacz
DonatorChristoph Buchheim
References