POLIP

library for polynomially constrained
mixed-integer programming


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

Open  ndcc15

Namendcc15
Classificationc|cc|d2
Problem typeMINLPLib2
Description
Objective sensemin
Variables680  (40 binary, 0 general integer, 640 continuous)
Nonlinear variables640
Constraints266
Nonlinear constraints40
Linear nonzeros1920
Nonlinear nonzeros1240
Download ndcc15.pip.gz ndcc15.gms.gz ndcc15.mod.gz
Best known solutionndcc15.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. Application: Network Design

© by maintainers  |     |  imprint