| Name | a1c1s1 |
| Download | a1c1s1.mps.gz |
| Solution | a1c1s1.sol.gz |
| Set Membership | Challenge |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | M. Vyve, Y. Pochet |
| Rows | 3312 |
| Cols | 3648 |
| Num. non-zeros in A | 10178 |
| Num. non-zeros in c | 1440 |
| Rows/Cols | 0.907894736842 |
| Integers | |
| Binaries | 192 |
| Continuous | 3456 |
| min nonzero |Aij| | 1 |
| max |Aij| | 480 |
| min nonzero |cj| | 0.0225 |
| max |cj| | 250 |
| Integer Objective | 11503.444125 |
| LP Objective | 997.529583 |
| Aggregation | 6 |
| Variable Bound | 1968 |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 1338 |
| General Cons. | |
| References |