POLIP

library for polynomially constrained
mixed-integer programming


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

Open  AnKeVa_2005_80dept_set1

NameAnKeVa_2005_80dept_set1
Classificationnc|bc|d2
Problem typequadratic_linear_ordering
Descriptionsingle-row facility layout problem modeled as a quadratic linear ordering problem
Objective sensemin
Variables3162  (3160 binary, 0 general integer, 2 continuous)
Nonlinear variables2
Constraints164320
Nonlinear constraints1
Linear nonzeros492960
Nonlinear nonzeros157055
Download AnKeVa_2005_80dept_set1.pip.gz AnKeVa_2005_80dept_set1.gms.gz AnKeVa_2005_80dept_set1.mod.gz AnKeVa_2005_80dept_set1.zpl.gz
Best known solution
Best known objective2138083.5
Best known bound1890976.8
Originator
FormulatorUlrike Pagacz
Donatortaken from FLP Database | University of Waterloo
References