POLIP

library for polynomially constrained
mixed-integer programming


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

Hard  clay0203m

Nameclay0203m
Classificationc|cc|d2
Problem typeMINLPLib2
Description
Objective sensemin
Variables33  (18 binary, 0 general integer, 15 continuous)
Nonlinear variables15
Constraints27
Nonlinear constraints27
Linear nonzeros90
Nonlinear nonzeros151
Download clay0203m.pip.gz clay0203m.gms.gz clay0203m.mod.gz
Best known solutionclay0203m.sol.gz
Best known objective41573.3
Best known bound41573.3
OriginatorCLay0203M.gms from CMU-IBM MINLP project page
FormulatorStefan Vigerske
DonatorStefan Vigerske
References Sawaya2006
Links MINLP Library 2
Additional informationNon overlapping rectangular units must be placed within the confines of certain designated areas such that the cost of connecting these units is minimized. Application: Layout

© by maintainers  |     |  imprint