| Name | rmine10 |
| Download | rmine10.mps.gz |
| Solution | rmine10.sol.gz |
| Set Membership | Challenge |
| Problem Status | Hard |
| Problem Feasibility | Feasible |
| Originator/Contributor | D. Espinoza |
| Rows | 65274 |
| Cols | 8439 |
| Num. non-zeros in A | 162264 |
| Num. non-zeros in c | 8439 |
| Rows/Cols | 7.73480270174 |
| Integers | |
| Binaries | 8439 |
| Continuous | |
| min nonzero |Aij| | 1 |
| max |Aij| | 99.9218 |
| min nonzero |cj| | 0.000208 |
| max |cj| | 3.869961 |
| Integer Objective | -1913.88062 |
| LP Objective | -1926.86382 |
| Aggregation | |
| Variable Bound | 65254 |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 20 |
| General Cons. | |
| References |
Instance coming from open pit mining over a cube considering multiple time periods and two knapsack constraints per period.
Solved by using ParaSCIP(ug[SCIP, MPI]) on HLRN III and Titan with 48 restarted jobs,
as described in ShinanoEtAl2015
(up to job 41).
The biggest scale used was up to 80,000 cores on Titan and the longest computation of one job
was about 2 weeks on HLRN III with 12,000 cores (23,999 solver processes using hyper-threading).