library for polynomially constrained
mixed-integer programming

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

Hard  hadamard_6

Problem typehadamard
DescriptionMaximize determinant of 6 times 6 binary matrix
Objective sensemax
Variables36  (36 binary, 0 general integer, 0 continuous)
Nonlinear variables36
Nonlinear constraints0
Linear nonzeros0
Nonlinear nonzeros720
Download hadamard_6.pip.gz
Best known solution
Best known objective9
Best known bound9
OriginatorMarc Pfetsch
FormulatorMarc Pfetsch
DonatorMarc Pfetsch
Additional informationLet a(n) be the maximal determinant of a 0/1-matrix of size n by n. Hadamard proved that a(n) ≤ 2(-n) (n+1)((n+1)/2). A Hadamard matrix attains this bound. The Hadamard conjecture states that this is the case if and only if n+1 is 1 or 2 or a multiple of 4. The values of a(n) for small n are known. See the on-line encyclopedia of integer sequences for more information.

© by maintainers  |     |  imprint