| Name | neos-1224597 |
| Download | neos-1224597.mps.gz |
| Solution | neos-1224597.sol.gz |
| Set Membership | Primal |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | NEOS Server Submission |
| Rows | 3276 |
| Cols | 3395 |
| Num. non-zeros in A | 25090 |
| Num. non-zeros in c | 3395 |
| Rows/Cols | 0.964948453608 |
| Integers | 245 |
| Binaries | 3150 |
| Continuous | |
| min nonzero |Aij| | 0.5 |
| max |Aij| | 7 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | -428 |
| LP Objective | -428 |
| Aggregation | |
| Variable Bound | 470 |
| Set partitioning | 28 |
| Set packing | 1565 |
| Set covering | |
| Cardinality | 28 |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 735 |
| Knapsacks | 100 |
| Integer Knapsack | |
| Mixed 0/1 | 260 |
| General Cons. | 420 |
| References |