| Name | n4-3 |
| Download | n4-3.mps.gz |
| Solution | n4-3.sol.gz |
| Set Membership | Benchmark |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | A. Atamtürk |
| Rows | 1236 |
| Cols | 3596 |
| Num. non-zeros in A | 14036 |
| Num. non-zeros in c | 3538 |
| Rows/Cols | 0.343715239155 |
| Integers | 174 |
| Binaries | |
| Continuous | 3422 |
| min nonzero |Aij| | 1 |
| max |Aij| | 255 |
| min nonzero |cj| | 1 |
| max |cj| | 300 |
| Integer Objective | 8993 |
| LP Objective | 4080.882353 |
| Aggregation | 118 |
| Variable Bound | |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 1002 |
| General Cons. | 116 |
| References |