POLIP

library for polynomially constrained
mixed-integer programming


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

Open  ndcc16persp

Namendcc16persp
Classificationc|cc|d2
Problem typeMINLPLib2
Description
Objective sensemin
Variables1140  (60 binary, 0 general integer, 1080 continuous)
Nonlinear variables1080
Constraints377
Nonlinear constraints60
Linear nonzeros4080
Nonlinear nonzeros180
Download ndcc16persp.pip.gz ndcc16persp.gms.gz ndcc16persp.mod.gz
Best known solutionndcc16persp.sol.gz
Best known objective117.009
Best known bound55.7419
Originator
FormulatorStefan Vigerske
DonatorStefan Vigerske
References GuenluekLinderoth2010 GuenluekLinderoth2012 BoorstynFrank1977
Links MINLP Library 2
Additional informationMulticommodity network design problem with congestion constraints and fixed costs for opening arcs. Perspective reformulation of ndcc16. Application: Network Design

© by maintainers  |     |  imprint