Submitter | Variables | Constraints | Density | Status | Group | Objective | MPS File |
---|---|---|---|---|---|---|---|

Daniel Espinoza | 3200 | 63608 | 7.50657e-04 | easy | opm2 | -15775 | opm2-z8-s0.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 | 3200 | 3023 |

Constraints | 63608 | 54975 |

Binaries | 3200 | 3023 |

Integers | 0 | 0 |

Continuous | 0 | 0 |

Implicit Integers | 0 | 0 |

Fixed Variables | 0 | 0 |

Nonzero Density | 0.000750657 | 0.000806977 |

Nonzeroes | 152793 | 134111 |

Original | Presolved | |
---|---|---|

Total | 63608 | 54975 |

Empty | 0 | 0 |

Free | 0 | 0 |

Singleton | 0 | 0 |

Aggregations | 0 | 0 |

Precedence | 63600 | 54967 |

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.00182 | 0.00182 | 0.00182 | 0.00182 | |

Variable % | 99.96690 | 99.96690 | 99.96690 | 99.96690 | |

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 | -15775 | -15775 | 0 | 0 | 0 | - | 2018-10-13 | Solution found during MIPLIB2017 problem selection. |

The following instances are most similar to opm2-z8-s0 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-z10-s4 | hard | 6250 | 6250 | 0 | 0 | 160633 | 371240 | Daniel Espinoza | opm2 | -33269 | benchmark binary benchmark_suitable precedence knapsack |

opm2-z6-s1 | easy | 1350 | 1350 | 0 | 0 | 15533 | 41844 | Daniel Espinoza | opm2 | -6202 | binary benchmark_suitable precedence knapsack |

opm2-z12-s8 | hard | 10800 | 10800 | 0 | 0 | 319508 | 725377 | Daniel Espinoza | opm2 | -58540 | binary precedence knapsack |

rmine11 | open | 12292 | 12292 | 0 | 0 | 97389 | 241240 | Daniel Espinoza | rmine | -2508.404144* | binary precedence mixed_binary |

`No bibliographic information available`

Last Update 2024 by Julian Manns

generated with R Markdown

© by Zuse Institute Berlin (ZIB)

Imprint