POLIP

library for polynomially constrained
mixed-integer programming


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

Displaying instances of type hadamard.

Filter by type:
status name type classification vars nonlin
vars
lin
cons
nonlin
cons
lin
nonzeros
nonlin
nonzeros
sense best primal best dual
Easy hadamard_4 hadamard nc|b|d4 16 16 0 0 0 24 max 3 3
Easy hadamard_5 hadamard nc|b|d5 25 25 0 0 0 120 max 5 5
Hard hadamard_6 hadamard nc|b|d6 36 36 0 0 0 720 max 9 9
Hard hadamard_7 hadamard nc|b|d7 49 49 0 0 0 5040 max 32 32
Hard hadamard_8 hadamard nc|b|d8 64 64 0 0 0 40320 max 56 56
Hard hadamard_9 hadamard nc|b|d9 81 81 0 0 0 362880 max 144 144

Status:
easy instance can be solved within an hour with a general-purpose solver (to a final gap of at least 0.1%)
hard instance has been solved (to a final gap of at least 0.1%, possibly by a problem-specific algorithm)
open optimal solution to instance is unknown

Classification: A|BC|D where
A is problem type: c (convex) or nc (nonconvex),
B is type of linear variables (i.e. only appearing in linear terms): b (only binary), i (only binary or general integers), c (also continuous), or 0 if none
C is type of nonlinear variables (i.e. appearing in nonlinear terms): b (only binary), i (only binary or general integers), c (also continuous), or 0 if none, and
D is maximum degree of the polynomials.


© by maintainers  |  last update LAST_CHANGE  |  imprint