| Name | net12 |
| Download | net12.mps.gz |
| Solution | net12.sol.gz |
| Set Membership | Benchmark Reoptimize |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | P. Belotti |
| Rows | 14021 |
| Cols | 14115 |
| Num. non-zeros in A | 80384 |
| Num. non-zeros in c | 39 |
| Rows/Cols | 0.993340417995 |
| Integers | |
| Binaries | 1603 |
| Continuous | 12512 |
| min nonzero |Aij| | 1 |
| max |Aij| | 12 |
| min nonzero |cj| | 1 |
| max |cj| | 20 |
| Integer Objective | 214 |
| LP Objective | 17.249479 |
| Aggregation | |
| Variable Bound | 10 |
| Set partitioning | 10 |
| Set packing | 391 |
| Set covering | 2 |
| Cardinality | 542 |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 12 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 13066 |
| General Cons. | |
| References |