| Name | neos-1311124 |
| Download | neos-1311124.mps.gz |
| Set Membership | Challenge |
| Problem Status | Open |
| Problem Feasibility | Feasible |
| Originator/Contributor | NEOS Server Submission |
| Rows | 1643 |
| Cols | 1092 |
| Num. non-zeros in A | 7140 |
| Num. non-zeros in c | 546 |
| Rows/Cols | 1.50457875458 |
| Integers | |
| Binaries | 546 |
| Continuous | 546 |
| min nonzero |Aij| | 1 |
| max |Aij| | 4092 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | Unknown |
| LP Objective | -182 |
| Aggregation | |
| Variable Bound | 714 |
| Set partitioning | |
| Set packing | 189 |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 740 |
| General Cons. | |
| References |