| Name | neos-1605061 |
| Download | neos-1605061.mps.gz |
| Solution | neos-1605061.sol.gz |
| Set Membership | Reoptimize |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | NEOS Server Submission |
| Rows | 3474 |
| Cols | 4111 |
| Num. non-zeros in A | 93483 |
| Num. non-zeros in c | 1 |
| Rows/Cols | 0.845049866213 |
| Integers | |
| Binaries | 3570 |
| Continuous | 541 |
| min nonzero |Aij| | 1 |
| max |Aij| | 10000 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | 12 |
| LP Objective | 6.150735 |
| Aggregation | |
| Variable Bound | |
| Set partitioning | 563 |
| Set packing | |
| Set covering | 5 |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 5 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 2906 |
| General Cons. | |
| References |