POLIP

library for polynomially constrained
mixed-integer programming


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

Open  ndcc15persp

Namendcc15persp
Classificationc|cc|d2
Problem typeMINLPLib2
Description
Objective sensemin
Variables720  (40 binary, 0 general integer, 680 continuous)
Nonlinear variables680
Constraints306
Nonlinear constraints40
Linear nonzeros2560
Nonlinear nonzeros120
Download ndcc15persp.pip.gz ndcc15persp.gms.gz ndcc15persp.mod.gz
Best known solutionndcc15persp.sol.gz
Best known objective94.6112
Best known bound76.0284
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 ndcc15. Application: Network Design

© by maintainers  |     |  imprint