| Name | queens-30 |
| Download | queens-30.mps.gz |
| Set Membership | Challenge |
| Problem Status | Open |
| Problem Feasibility | Feasible |
| Originator/Contributor | A. Mahajan |
| Rows | 960 |
| Cols | 900 |
| Num. non-zeros in A | 93440 |
| Num. non-zeros in c | 900 |
| Rows/Cols | 1.06666666667 |
| Integers | |
| Binaries | 900 |
| Continuous | |
| min nonzero |Aij| | 1 |
| max |Aij| | 7 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | Unknown |
| LP Objective | -70.912689 |
| Aggregation | |
| Variable Bound | |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | 960 |
| 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