POLIP

library for polynomially constrained
mixed-integer programming


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

Hard  slay08m

Nameslay08m
Classificationc|cc|d2
Problem typeMINLPLib2
Description
Objective sensemin
Variables185  (112 binary, 0 general integer, 73 continuous)
Nonlinear variables73
Constraints221
Nonlinear constraints31
Linear nonzeros722
Nonlinear nonzeros181
Download slay08m.pip.gz slay08m.gms.gz slay08m.mod.gz
Best known solutionslay08m.sol.gz
Best known objective84960.2
Best known bound84960.2
OriginatorSLay08M.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