| Name | neos16 |
| Download | neos16.mps.gz |
| Solution | neos16.sol.gz |
| Set Membership | Tree |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | NEOS Server Submission |
| Rows | 1018 |
| Cols | 377 |
| Num. non-zeros in A | 2801 |
| Num. non-zeros in c | 1 |
| Rows/Cols | 2.70026525199 |
| Integers | 41 |
| Binaries | 336 |
| Continuous | |
| min nonzero |Aij| | 1 |
| max |Aij| | 7 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | 446 |
| LP Objective | 429 |
| Aggregation | |
| Variable Bound | 336 |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | 9 |
| Mixed 0/1 | |
| General Cons. | 682 |
| References |