POLIP

library for polynomially constrained
mixed-integer programming


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

Hard  clay0204m

Nameclay0204m
Classificationc|cc|d2
Problem typeMINLPLib2
Description
Objective sensemin
Variables55  (32 binary, 0 general integer, 23 continuous)
Nonlinear variables23
Constraints51
Nonlinear constraints39
Linear nonzeros174
Nonlinear nonzeros211
Download clay0204m.pip.gz clay0204m.gms.gz clay0204m.mod.gz
Best known solutionclay0204m.sol.gz
Best known objective6545
Best known bound6545
OriginatorCLay0204M.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