| Name | ic97_potential |
| Download | ic97_potential.mps.gz |
| Solution | ic97_potential.sol.gz |
| Set Membership | Challenge |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | L. Peeters |
| Rows | 1046 |
| Cols | 728 |
| Num. non-zeros in A | 3138 |
| Num. non-zeros in c | 280 |
| Rows/Cols | 1.43681318681 |
| Integers | 73 |
| Binaries | 450 |
| Continuous | 205 |
| min nonzero |Aij| | 1 |
| max |Aij| | 60 |
| min nonzero |cj| | 1 |
| max |cj| | 60 |
| Integer Objective | 3942 |
| LP Objective | 3868 |
| Aggregation | |
| Variable Bound | |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 900 |
| General Cons. | 146 |
| References |