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

Timo Berthold | 3 | 1 | 1 | easy | – | 25508 | ej.mps.gz |

Number theoretic problem. In my opinion not suited for benchmarking, also depends a lot on numerical tolerances. But an interesting problem nevertheless. Reference: https://dx.doi.org/10.1016/j.jsc.2007.08.005

Detailed explanation of the following tables can be found here.

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

Variables | 3 | 3 |

Constraints | 1 | 1 |

Binaries | 0 | 0 |

Integers | 3 | 3 |

Continuous | 0 | 0 |

Implicit Integers | 0 | 0 |

Fixed Variables | 0 | 0 |

Nonzero Density | 1 | 1 |

Nonzeroes | 3 | 3 |

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

Total | 1 | 1 |

Empty | 0 | 0 |

Free | 0 | 0 |

Singleton | 0 | 0 |

Aggregations | 0 | 0 |

Precedence | 0 | 0 |

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 | 0 | 0 |

Integer Knapsack | 0 | 0 |

Mixed Binary | 0 | 0 |

General Linear | 1 | 1 |

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 % | 100 | 100 | 100 | 100 | |

Variable % | 100 | 100 | 100 | 100 | |

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

The following instances are most similar to ej 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 |
---|---|---|---|---|---|---|---|---|---|---|---|

enlight_hard | easy | 200 | 100 | 100 | 0 | 100 | 560 | A. Zymolka | enlight | 37 | benchmark benchmark_suitable equation_knapsack general_linear |

enlight9 | easy | 162 | 81 | 81 | 0 | 81 | 450 | A. Zymolka | enlight | Infeasible | infeasible equation_knapsack general_linear |

enlight8 | easy | 128 | 64 | 64 | 0 | 64 | 352 | A. Zymolka | enlight | 27 | equation_knapsack general_linear |

enlight11 | easy | 242 | 121 | 121 | 0 | 121 | 682 | A. Zymolka | enlight | Infeasible | infeasible equation_knapsack general_linear |

enlight4 | easy | 32 | 16 | 16 | 0 | 16 | 80 | A. Zymolka | enlight | Infeasible | infeasible equation_knapsack general_linear |

`No bibliographic information available`

Last Update 2024 by Julian Manns

generated with R Markdown

© by Zuse Institute Berlin (ZIB)

Imprint