| Name | protfold |
| Download | protfold.mps.gz |
| Set Membership | Reoptimize |
| Problem Status | Hard |
| Problem Feasibility | Feasible |
| Originator/Contributor | A. Fügenschuh |
| Rows | 2112 |
| Cols | 1835 |
| Num. non-zeros in A | 23491 |
| Num. non-zeros in c | 120 |
| Rows/Cols | 1.15095367847 |
| Integers | |
| Binaries | 1835 |
| Continuous | |
| min nonzero |Aij| | 1 |
| max |Aij| | 1 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | -31 |
| LP Objective | -41.957447 |
| Aggregation | |
| Variable Bound | |
| Set partitioning | 35 |
| Set packing | 49 |
| Set covering | 1666 |
| Cardinality | 2 |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 2026 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 120 |
| General Cons. | |
| References |