| Name | rmine25 |
| Download | rmine25.mps.gz |
| Set Membership | Challenge XXL |
| Problem Status | Open |
| Problem Feasibility | Feasible |
| Originator/Contributor | D. Espinoza |
| Rows | 2953849 |
| Cols | 326599 |
| Num. non-zeros in A | 7182744 |
| Num. non-zeros in c | 326599 |
| Rows/Cols | 9.04426835355 |
| Integers | |
| Binaries | 326599 |
| Continuous | |
| min nonzero |Aij| | 1 |
| max |Aij| | 99.99754 |
| min nonzero |cj| | 8e-06 |
| max |cj| | 0.999728 |
| Integer Objective | Unknown |
| LP Objective | -15667.9 |
| Aggregation | |
| Variable Bound | 2953799 |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 50 |
| General Cons. | |
| References |
Instance coming from open pit mining over a cube considering multiple time periods and two knapsack constraints per period