POLIP

library for polynomially constrained
mixed-integer programming


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

Hard  slay10h

Nameslay10h
Classificationc|cc|d2
Problem typeMINLPLib2
Description
Objective sensemin
Variables1010  (180 binary, 0 general integer, 830 continuous)
Nonlinear variables830
Constraints1305
Nonlinear constraints0
Linear nonzeros3600
Nonlinear nonzeros130
Download slay10h.pip.gz slay10h.gms.gz slay10h.mod.gz
Best known solutionslay10h.sol.gz
Best known objective129580
Best known bound129580
OriginatorSLay10H.gms from CMU-IBM MINLP project page
FormulatorStefan Vigerske
DonatorStefan Vigerske
References Sawaya2006
Links MINLP Library 2
Additional informationDetermine the optimal placement of a set of units with fixed width and length such that the Euclidean distance between their center point and a predefined "safety point" is minimized. Application: Layout

© by maintainers  |     |  imprint