| Name | opm2-z12-s14 |
| Download | opm2-z12-s14.mps.gz |
| Solution | opm2-z12-s14.sol.gz |
| Set Membership | Challenge Reoptimize |
| Problem Status | Hard |
| Problem Feasibility | Feasible |
| Originator/Contributor | D. Espinoza |
| Rows | 319508 |
| Cols | 10800 |
| Num. non-zeros in A | 725376 |
| Num. non-zeros in c | 10733 |
| Rows/Cols | 29.5840740741 |
| Integers | |
| Binaries | 10800 |
| Continuous | |
| min nonzero |Aij| | 1 |
| max |Aij| | 4094 |
| min nonzero |cj| | 1 |
| max |cj| | 575 |
| Integer Objective | -64291 |
| LP Objective | -91524.54224 |
| Aggregation | |
| Variable Bound | 319500 |
| 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 49164 seconds (January 2012).