| Name | rmine6 |
| Download | rmine6.mps.gz |
| Solution | rmine6.sol.gz |
| Set Membership | Benchmark |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | D. Espinoza |
| Rows | 7078 |
| Cols | 1096 |
| Num. non-zeros in A | 18084 |
| Num. non-zeros in c | 1096 |
| Rows/Cols | 6.45802919708 |
| Integers | |
| Binaries | 1096 |
| Continuous | |
| min nonzero |Aij| | 1 |
| max |Aij| | 99.67027 |
| min nonzero |cj| | 0.001141 |
| max |cj| | 5.895621 |
| Integer Objective | -457.18614 |
| LP Objective | -462.305727 |
| Aggregation | |
| Variable Bound | 7066 |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 12 |
| General Cons. | |
| References |
Instance coming from open pit mining over a cube considering multiple time periods and two knapsack constraints per period