POLIP

library for polynomially constrained
mixed-integer programming


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

Easy  bip_cross_min.10.10.40.1

Namebip_cross_min.10.10.40.1
Classificationnc|bc|d2
Problem typequadratic_linear_ordering
Descriptionedge-crossing minimization in bipartite graphs modeled as a quadratic linear ordering problem
Objective sensemin
Variables91  (90 binary, 0 general integer, 1 continuous)
Nonlinear variables1
Constraints480
Nonlinear constraints1
Linear nonzeros1440
Nonlinear nonzeros633
Download bip_cross_min.10.10.40.1.pip.gz bip_cross_min.10.10.40.1.gms.gz bip_cross_min.10.10.40.1.mod.gz bip_cross_min.10.10.40.1.zpl.gz
Best known solutionbip_cross_min.10.10.40.1.sol.gz
Best known objective142
Best known bound142
OriginatorChristoph Buchheim, Angelika Wiegele, Lanbo Zheng
FormulatorUlrike Pagacz
DonatorChristoph Buchheim
References