| Name | opm2-z10-s2 |
| Download | opm2-z10-s2.mps.gz |
| Solution | opm2-z10-s2.sol.gz |
| Set Membership | Challenge |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | D. Espinoza |
| Rows | 160633 |
| Cols | 6250 |
| Num. non-zeros in A | 371243 |
| Num. non-zeros in c | 6202 |
| Rows/Cols | 25.70128 |
| Integers | |
| Binaries | 6250 |
| Continuous | |
| min nonzero |Aij| | 1 |
| max |Aij| | 4094 |
| min nonzero |cj| | 1 |
| max |cj| | 477 |
| Integer Objective | -33826 |
| LP Objective | -49308.278601 |
| Aggregation | |
| Variable Bound | 160625 |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | 8 |
| Integer Knapsack | |
| Mixed 0/1 | |
| General Cons. | |
| References |
Problem coming from precedence constrained knapsacks arising in mining applications. Solved by Gurobi 4.6.1 (12 threads) in 10131 seconds (January 2012).