| Submitter | Variables | Constraints | Density | Status | Group | Objective | MPS File |
|---|---|---|---|---|---|---|---|
| Daniel Espinoza | 1350 | 15533 | 1.99546e-03 | easy | opm2 | -6202 | opm2-z6-s1.mps.gz |
Problems coming from precedence constrained knapsacks arising in mining applications. These are one-period problems with integer data but large root LP GAP Imported from the MIPLIB2010 submissions.
Detailed explanation of the following tables can be found here.
| Original | Presolved | |
|---|---|---|
| Variables | 1350 | 1256 |
| Constraints | 15533 | 12431 |
| Binaries | 1350 | 1256 |
| Integers | 0 | 0 |
| Continuous | 0 | 0 |
| Implicit Integers | 0 | 0 |
| Fixed Variables | 0 | 0 |
| Nonzero Density | 0.00199546 | 0.00223456 |
| Nonzeroes | 41844 | 34889 |
| Original | Presolved | |
|---|---|---|
| Total | 15533 | 12431 |
| Empty | 0 | 0 |
| Free | 0 | 0 |
| Singleton | 0 | 0 |
| Aggregations | 0 | 0 |
| Precedence | 15525 | 12423 |
| Variable Bound | 0 | 0 |
| Set Partitioning | 0 | 0 |
| Set Packing | 0 | 0 |
| Set Covering | 0 | 0 |
| Cardinality | 0 | 0 |
| Invariant Knapsack | 0 | 0 |
| Equation Knapsack | 0 | 0 |
| Bin Packing | 0 | 0 |
| Knapsack | 8 | 8 |
| Integer Knapsack | 0 | 0 |
| Mixed Binary | 0 | 0 |
| General Linear | 0 | 0 |
| Indicator | 0 | 0 |
Available nonzero structure and decomposition information. Further information can be found here.
Decomposed structure of original problem (dec-file)
Decomposed structure after trivial presolving (dec-file)
| value | min | median | mean | max | |
|---|---|---|---|---|---|
| Components | 0.30103 | ||||
| Constraint % | 0.00804 | 0.00804 | 0.00804 | 0.00804 | |
| Variable % | 99.84080 | 99.84080 | 99.84080 | 99.84080 | |
| Score | 0.00000 |
Find solutions below. Download the archive containing all solutions from the Download page.
| ID | Objective | Exact | Int. Viol | Cons. Viol | Obj. Viol | Submitter | Date | Description |
|---|---|---|---|---|---|---|---|---|
| 1 | -6202 | -6202 | 0 | 0 | 0 | - | 2018-10-13 | Solution found during MIPLIB2017 problem selection. |
The following instances are most similar to opm2-z6-s1 in the collection. This similarity analysis is based on 100 scaled instance features describing properties of the variables, objective function, bounds, constraints, and right hand sides.
| Instance | Status | Variables | Binaries | Integers | Continuous | Constraints | Nonz. | Submitter | Group | Objective | Tags |
|---|---|---|---|---|---|---|---|---|---|---|---|
| opm2-z7-s8 | easy | 2023 | 2023 | 0 | 0 | 31798 | 79756 | Daniel Espinoza | opm2 | -11242 | binary benchmark_suitable precedence knapsack |
| opm2-z8-s0 | easy | 3200 | 3200 | 0 | 0 | 63608 | 152793 | Daniel Espinoza | opm2 | -15775 | binary benchmark_suitable precedence knapsack |
| opm2-z10-s4 | easy | 6250 | 6250 | 0 | 0 | 160633 | 371240 | Daniel Espinoza | opm2 | -33269 | benchmark binary benchmark_suitable precedence knapsack |
| rmine11 | open | 12292 | 12292 | 0 | 0 | 97389 | 241240 | Daniel Espinoza | rmine | -2508.404144* | binary precedence mixed_binary |
| reblock354 | hard | 3540 | 3540 | 0 | 0 | 19906 | 52901 | Andreas Bley | reblock | -39280521.2281657 | binary precedence knapsack |
No bibliographic information available