POLIP

library for polynomially constrained
mixed-integer programming


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

Open  bip_cross_min.22.22.48.1

Namebip_cross_min.22.22.48.1
Classificationnc|bc|d2
Problem typequadratic_linear_ordering
Descriptionedge-crossing minimization in bipartite graphs modeled as a quadratic linear ordering problem
Objective sensemin
Variables463  (462 binary, 0 general integer, 1 continuous)
Nonlinear variables1
Constraints6160
Nonlinear constraints1
Linear nonzeros18480
Nonlinear nonzeros1358
Download bip_cross_min.22.22.48.1.pip.gz bip_cross_min.22.22.48.1.gms.gz bip_cross_min.22.22.48.1.mod.gz bip_cross_min.22.22.48.1.zpl.gz
Best known solution
Best known objective
Best known bound
OriginatorChristoph Buchheim, Angelika Wiegele, Lanbo Zheng
FormulatorUlrike Pagacz
DonatorChristoph Buchheim
References