| Name | neos-1426635 |
| Download | neos-1426635.mps.gz |
| Solution | neos-1426635.sol.gz |
| Set Membership | Tree |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | NEOS Server Submission |
| Rows | 796 |
| Cols | 520 |
| Num. non-zeros in A | 3400 |
| Num. non-zeros in c | 260 |
| Rows/Cols | 1.53076923077 |
| Integers | |
| Binaries | 260 |
| Continuous | 260 |
| min nonzero |Aij| | 1 |
| max |Aij| | 8184 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | -176 |
| LP Objective | -178 |
| Aggregation | |
| Variable Bound | 340 |
| Set partitioning | |
| Set packing | 90 |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 366 |
| General Cons. | |
| References |