| Name | neos-631710 |
| Download | neos-631710.mps.gz |
| Solution | neos-631710.sol.gz |
| Set Membership | Challenge Reoptimize |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | NEOS Server Submission |
| Rows | 169576 |
| Cols | 167056 |
| Num. non-zeros in A | 834166 |
| Num. non-zeros in c | 556 |
| Rows/Cols | 1.015084762 |
| Integers | |
| Binaries | 167056 |
| Continuous | |
| min nonzero |Aij| | 1 |
| max |Aij| | 4 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | 203 |
| LP Objective | 188.25 |
| Aggregation | |
| Variable Bound | 167055 |
| Set partitioning | 300 |
| Set packing | 1665 |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | 556 |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | |
| General Cons. | |
| References |