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

Irv Lustig | 207665 | 242245 | 2.04485e-05 | open | seqsolve | -40015.0* | seqsolve3short4288excess384.mps.gz |

The 3 problems in this group (seqsolve1â€“seqsolve3) represent a hierarchical optimization process, which is derived from a customer problem for assigning people to sites into blocks of time on days of the week. The specialty of this submission is that the best known solution for seqsolveX can be used as a MIP start for seqsolveX+1. For a description of the connections between the problems, please refer to the README.txt contained in the model data for this submission, which also includes MIP start files and a Gurobi log file.

Detailed explanation of the following tables can be found here.

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

Variables | 207665 | 174335 |

Constraints | 242245 | 199220 |

Binaries | 123834 | 97763 |

Integers | 82835 | 75576 |

Continuous | 996 | 996 |

Implicit Integers | 0 | 0 |

Fixed Variables | 0 | 0 |

Nonzero Density | 2.04485e-05 | 2.52641e-05 |

Nonzeroes | 1028680 | 877447 |

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

Total | 242245 | 199220 |

Empty | 0 | 0 |

Free | 0 | 0 |

Singleton | 149 | 0 |

Aggregations | 0 | 121 |

Precedence | 12381 | 0 |

Variable Bound | 178200 | 151260 |

Set Partitioning | 0 | 0 |

Set Packing | 151 | 56 |

Set Covering | 0 | 0 |

Cardinality | 0 | 0 |

Invariant Knapsack | 282 | 251 |

Equation Knapsack | 0 | 0 |

Bin Packing | 31442 | 28976 |

Knapsack | 16222 | 15398 |

Integer Knapsack | 2918 | 2779 |

Mixed Binary | 34 | 2 |

General Linear | 466 | 377 |

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

Constraint % | |||||

Variable % | |||||

Score |

Find solutions below. Download the archive containing all solutions from the Download page.

`## Warning in lapply(df["exactobjval"], as.numeric): NAs introduced by coercion`

ID | Objective | Exact | Int. Viol | Cons. Viol | Obj. Viol | Submitter | Date | Description |
---|---|---|---|---|---|---|---|---|

1 | -40015 | 0 | 0 | 0 | Michael Winkler | 2024-01-16 | found with Gurobi 10.0.2 on AMD EPYC 7313P 16-Core Processor with 264075352 kB memory and found with NoRel Heuristic |

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

`No bibliographic information available`

Last Update 2024 by Julian Manns

generated with R Markdown

© by Zuse Institute Berlin (ZIB)

Imprint