POLIP

library for polynomially constrained
mixed-integer programming


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

Hard  clay0305m

Nameclay0305m
Classificationc|cc|d2
Problem typeMINLPLib2
Description
Objective sensemin
Variables88  (55 binary, 0 general integer, 33 continuous)
Nonlinear variables33
Constraints86
Nonlinear constraints69
Linear nonzeros296
Nonlinear nonzeros386
Download clay0305m.pip.gz clay0305m.gms.gz clay0305m.mod.gz
Best known solutionclay0305m.sol.gz
Best known objective8092.5
Best known bound8092.5
OriginatorCLay0305M.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