POLIP

library for polynomially constrained
mixed-integer programming


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

Hard  slay07h

Nameslay07h
Classificationc|cc|d2
Problem typeMINLPLib2
Description
Objective sensemin
Variables476  (84 binary, 0 general integer, 392 continuous)
Nonlinear variables392
Constraints609
Nonlinear constraints0
Linear nonzeros1680
Nonlinear nonzeros70
Download slay07h.pip.gz slay07h.gms.gz slay07h.mod.gz
Best known solutionslay07h.sol.gz
Best known objective64748.8
Best known bound64748.8
OriginatorSLay07H.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