| Name | b2c1s1 |
| Download | b2c1s1.mps.gz |
| Solution | b2c1s1.sol.gz |
| Set Membership | Challenge |
| Problem Status | Hard |
| Problem Feasibility | Feasible |
| Originator/Contributor | M. Vyve, Y. Pochet |
| Rows | 3904 |
| Cols | 3872 |
| Num. non-zeros in A | 11408 |
| Num. non-zeros in c | 1568 |
| Rows/Cols | 1.00826446281 |
| Integers | |
| Binaries | 288 |
| Continuous | 3584 |
| min nonzero |Aij| | 0.2 |
| max |Aij| | 480 |
| min nonzero |cj| | 0.02 |
| max |cj| | 1200 |
| Integer Objective | 25687.9 |
| LP Objective | 4034.218333 |
| Aggregation | 16 |
| Variable Bound | 2560 |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 1328 |
| General Cons. | |
| References |