POLIP

library for polynomially constrained
mixed-integer programming


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

Open  ndcc13persp

Namendcc13persp
Classificationc|cc|d2
Problem typeMINLPLib2
Description
Objective sensemin
Variables672  (42 binary, 0 general integer, 630 continuous)
Nonlinear variables630
Constraints254
Nonlinear constraints42
Linear nonzeros2352
Nonlinear nonzeros126
Download ndcc13persp.pip.gz ndcc13persp.gms.gz ndcc13persp.mod.gz
Best known solutionndcc13persp.sol.gz
Best known objective85.8919
Best known bound68.3984
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 ndcc13. Application: Network Design

© by maintainers  |     |  imprint