POLIP

library for polynomially constrained
mixed-integer programming


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

Hard  slay08h

Nameslay08h
Classificationc|cc|d2
Problem typeMINLPLib2
Description
Objective sensemin
Variables632  (112 binary, 0 general integer, 520 continuous)
Nonlinear variables520
Constraints812
Nonlinear constraints0
Linear nonzeros2240
Nonlinear nonzeros88
Download slay08h.pip.gz slay08h.gms.gz slay08h.mod.gz
Best known solutionslay08h.sol.gz
Best known objective84960.2
Best known bound84960.2
OriginatorSLay08H.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