Sparsity pattern

wnq-n100-mw99-14

Namewnq-n100-mw99-14
Downloadwnq-n100-mw99-14.mps.gz
Solutionwnq-n100-mw99-14.sol.gz
Set Membership Challenge Tree
Problem StatusHard
Problem FeasibilityFeasible
Originator/ContributorM. Winkler
Rows656900
Cols10000
Num. non-zeros in A1333400
Num. non-zeros in c10000
Rows/Cols65.69
Integers
Binaries10000
Continuous
min nonzero |Aij|1
max |Aij|1
min nonzero |cj|1
max |cj|99
Integer Objective259
LP Objective185.263158
Aggregation
Variable Bound656700
Set partitioning
Set packing
Set covering200
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack200
Knapsacks
Integer Knapsack
Mixed 0/1
General Cons.
References pseudoboolean

Weighted n-queens problem with an additional separation constraint. Solved by Gurobi 4.6.1 (12 threads) in 28124 seconds (January 2012).


Last Update December 6, 2016 by Gerald Gamrath
© 2016 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint