POLIP

library for polynomially constrained
mixed-integer programming


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

Open  pb351575

Namepb351575
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 pb351575.pip.gz pb351575.gms.gz pb351575.mod.gz
Best known solutionpb351575.sol.gz
Best known objective6.30172e+06
Best known bound1.33444e+06
Originator
FormulatorStefan Vigerske
DonatorStefan Vigerske
References Mavrotas2009
Links MINLP Library 2
Additional informationGeneral Quadratic Assignment Problem

© by maintainers  |     |  imprint