POLIP

library for polynomially constrained
mixed-integer programming


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

Open  pb351595

Namepb351595
Classificationnc|bb|d2
Problem typeMINLPLib2
DescriptionGeneral Quadratic Assignment Problem
Objective sensemin
Variables525  (525 binary, 0 general integer, 0 continuous)
Nonlinear variables0
Constraints50
Nonlinear constraints0
Linear nonzeros1050
Nonlinear nonzeros125475
Download pb351595.pip.gz pb351595.gms.gz pb351595.mod.gz
Best known solutionpb351595.sol.gz
Best known objective6.67026e+06
Best known bound1.14655e+06
Originator
FormulatorStefan Vigerske
DonatorStefan Vigerske
References Mavrotas2009
Links MINLP Library 2
Additional informationGeneral Quadratic Assignment Problem

© by maintainers  |     |  imprint