POLIP

library for polynomially constrained
mixed-integer programming


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

Open  ndcc12persp

Namendcc12persp
Classificationc|cc|d2
Problem typeMINLPLib2
Description
Objective sensemin
Variables690  (46 binary, 0 general integer, 644 continuous)
Nonlinear variables644
Constraints237
Nonlinear constraints46
Linear nonzeros2392
Nonlinear nonzeros138
Download ndcc12persp.pip.gz ndcc12persp.gms.gz ndcc12persp.mod.gz
Best known solutionndcc12persp.sol.gz
Best known objective108.114
Best known bound48.5347
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 ndcc12. Application: Network Design

© by maintainers  |     |  imprint