| Name | n3div36 |
| Download | n3div36.mps.gz |
| Solution | n3div36.sol.gz |
| Set Membership | Benchmark |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | R. Meirich |
| Rows | 4484 |
| Cols | 22120 |
| Num. non-zeros in A | 340740 |
| Num. non-zeros in c | 22120 |
| Rows/Cols | 0.202712477396 |
| Integers | |
| Binaries | 22120 |
| Continuous | |
| min nonzero |Aij| | 1 |
| max |Aij| | 24 |
| min nonzero |cj| | 10200 |
| max |cj| | 110800 |
| Integer Objective | 130800 |
| LP Objective | 114333.374741 |
| Aggregation | |
| Variable Bound | |
| Set partitioning | |
| Set packing | 4424 |
| Set covering | 2 |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 2 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 58 |
| General Cons. | |
| References |