POLIP

library for polynomially constrained
mixed-integer programming


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

Open  ndcc14persp

Namendcc14persp
Classificationc|cc|d2
Problem typeMINLPLib2
Description
Objective sensemin
Variables918  (54 binary, 0 general integer, 864 continuous)
Nonlinear variables864
Constraints305
Nonlinear constraints54
Linear nonzeros3240
Nonlinear nonzeros162
Download ndcc14persp.pip.gz ndcc14persp.gms.gz ndcc14persp.mod.gz
Best known solutionndcc14persp.sol.gz
Best known objective117.865
Best known bound59.2939
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 ndcc14. Application: Network Design

© by maintainers  |     |  imprint