| Name | neos-937815 |
| Download | neos-937815.mps.gz |
| Solution | neos-937815.sol.gz |
| Set Membership | Challenge Reoptimize |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | NEOS Server Submission |
| Rows | 9251 |
| Cols | 11646 |
| Num. non-zeros in A | 48013 |
| Num. non-zeros in c | 11646 |
| Rows/Cols | 0.794349991413 |
| Integers | |
| Binaries | 8876 |
| Continuous | 2770 |
| min nonzero |Aij| | 1 |
| max |Aij| | 1 |
| min nonzero |cj| | 1 |
| max |cj| | 500 |
| Integer Objective | 2845 |
| LP Objective | 2837 |
| Aggregation | |
| Variable Bound | 5603 |
| Set partitioning | |
| Set packing | 2697 |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 57 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 894 |
| General Cons. | |
| References |