| Name | n3705 |
| Download | n3705.mps.gz |
| Set Membership | Challenge |
| Problem Status | Open |
| Problem Feasibility | Feasible |
| Originator/Contributor | J. Aronson |
| Rows | 5150 |
| Cols | 10000 |
| Num. non-zeros in A | 20000 |
| Num. non-zeros in c | 10000 |
| Rows/Cols | 0.515 |
| Integers | |
| Binaries | 5000 |
| Continuous | 5000 |
| min nonzero |Aij| | 1 |
| max |Aij| | 3107 |
| min nonzero |cj| | 3 |
| max |cj| | 25595 |
| Integer Objective | Unknown |
| LP Objective | 973361.017012 |
| Aggregation | |
| Variable Bound | 5000 |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 150 |
| General Cons. | |
| References |