| Name | ran14x18-disj-8 |
| Download | ran14x18-disj-8.mps.gz |
| Solution | ran14x18-disj-8.sol.gz |
| Set Membership | Tree |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | J. Aronson |
| Rows | 447 |
| Cols | 504 |
| Num. non-zeros in A | 10277 |
| Num. non-zeros in c | 504 |
| Rows/Cols | 0.886904761905 |
| Integers | |
| Binaries | 252 |
| Continuous | 252 |
| min nonzero |Aij| | 3.222851e-09 |
| max |Aij| | 38 |
| min nonzero |cj| | 1 |
| max |cj| | 264 |
| Integer Objective | 3712 |
| LP Objective | 3444.421066 |
| Aggregation | |
| Variable Bound | 252 |
| Set partitioning | |
| Set packing | |
| Set covering | 49 |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 50 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 146 |
| General Cons. | |
| References |