Sparsity pattern

queens-30

Namequeens-30
Downloadqueens-30.mps.gz
Solutionqueens-30.sol.gz
Set Membership Challenge
Problem StatusHard
Problem FeasibilityFeasible
Originator/ContributorA. Mahajan
Rows960
Cols900
Num. non-zeros in A93440
Num. non-zeros in c900
Rows/Cols1.06666666667
Integers
Binaries900
Continuous
min nonzero |Aij|1
max |Aij|7
min nonzero |cj|1
max |cj|1
Integer Objective-40
LP Objective-70.912689
Aggregation
Variable Bound
Set partitioning
Set packing
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks960
Integer Knapsack
Mixed 0/1
General Cons.
References queenschallenge

Models the problem of placing as many queens on a 30 by 30 chess board as possible so that each queen threatens at most one other queen. The problem and a proof of the optimal solution value are stated in queenschallenge


Last Update February 28, 2017 by Gerald Gamrath
© 2017 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint