POLIP

library for polynomially constrained
mixed-integer programming


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

Open  ndcc13

Namendcc13
Classificationc|cc|d2
Problem typeMINLPLib2
Description
Objective sensemin
Variables630  (42 binary, 0 general integer, 588 continuous)
Nonlinear variables588
Constraints212
Nonlinear constraints42
Linear nonzeros1764
Nonlinear nonzeros1134
Download ndcc13.pip.gz ndcc13.gms.gz ndcc13.mod.gz
Best known solutionndcc13.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. Application: Network Design

© by maintainers  |     |  imprint