| Name | neos-1426662 |
| Download | neos-1426662.mps.gz |
| Solution | neos-1426662.sol.gz |
| Set Membership | Tree |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | NEOS Server Submission |
| Rows | 1914 |
| Cols | 832 |
| Num. non-zeros in A | 8048 |
| Num. non-zeros in c | 416 |
| Rows/Cols | 2.30048076923 |
| Integers | |
| Binaries | 416 |
| Continuous | 416 |
| min nonzero |Aij| | 1 |
| max |Aij| | 1023 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | -44 |
| LP Objective | -52 |
| Aggregation | |
| Variable Bound | 992 |
| Set partitioning | |
| Set packing | 48 |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 874 |
| General Cons. | |
| References |