| Name | ns1111636 |
| Download | ns1111636.mps.gz |
| Solution | ns1111636.sol.gz |
| Set Membership | Challenge Reoptimize |
| Problem Status | Hard |
| Problem Feasibility | Feasible |
| Originator/Contributor | H. Mittelmann, Neos Server |
| Rows | 13895 |
| Cols | 360822 |
| Num. non-zeros in A | 568444 |
| Num. non-zeros in c | 22 |
| Rows/Cols | 0.0385092926706 |
| Integers | |
| Binaries | 13200 |
| Continuous | 347622 |
| min nonzero |Aij| | 1 |
| max |Aij| | 192 |
| min nonzero |cj| | 4 |
| max |cj| | 10 |
| Integer Objective | 162 |
| LP Objective | 96.25 |
| Aggregation | |
| Variable Bound | |
| Set partitioning | |
| Set packing | 440 |
| Set covering | |
| Cardinality | 4400 |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 11 |
| Knapsacks | 11 |
| Integer Knapsack | |
| Mixed 0/1 | 9033 |
| General Cons. | |
| References |