POLIP

library for polynomially constrained
mixed-integer programming


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

Open  ndcc12

Namendcc12
Classificationc|cc|d2
Problem typeMINLPLib2
Description
Objective sensemin
Variables644  (46 binary, 0 general integer, 598 continuous)
Nonlinear variables598
Constraints191
Nonlinear constraints46
Linear nonzeros1794
Nonlinear nonzeros1150
Download ndcc12.pip.gz ndcc12.gms.gz ndcc12.mod.gz
Best known solutionndcc12.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. Application: Network Design

© by maintainers  |     |  imprint