POLIP

library for polynomially constrained
mixed-integer programming


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

Hard  clay0304m

Nameclay0304m
Classificationc|cc|d2
Problem typeMINLPLib2
Description
Objective sensemin
Variables59  (36 binary, 0 general integer, 23 continuous)
Nonlinear variables23
Constraints51
Nonlinear constraints55
Linear nonzeros177
Nonlinear nonzeros308
Download clay0304m.pip.gz clay0304m.gms.gz clay0304m.mod.gz
Best known solutionclay0304m.sol.gz
Best known objective40262.4
Best known bound40262.4
OriginatorCLay0304M.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