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

Gleb Belov | 40623 | 40935 | 5.782e-05 | easy | radiation | 17566 | radiationm18-12-05.mps.gz |

Linearized Constraint Programming models of the MiniZinc Challenges 2012-2016. I should be able to produce versions with indicator constraints supported by Gurobi and CPLEX, however don’t know if you can use them and if there is a standard format. These MPS were produced by Gurobi 7.0.2 using the MiniZinc develop branch on eb536656062ca13325a96b5d0881742c7d0e3c38

Detailed explanation of the following tables can be found here.

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

Variables | 40623 | 36322 |

Constraints | 40935 | 36702 |

Binaries | 14688 | 16197 |

Integers | 11247 | 6619 |

Continuous | 14688 | 13506 |

Implicit Integers | 0 | 27 |

Fixed Variables | 0 | 0 |

Nonzero Density | 5.7820e-05 | 6.1587e-05 |

Nonzeroes | 96149 | 82101 |

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

Total | 40935 | 36961 |

Empty | 0 | 0 |

Free | 0 | 0 |

Singleton | 0 | 0 |

Aggregations | 25704 | 25840 |

Precedence | 3672 | 1860 |

Variable Bound | 3672 | 4829 |

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

Mixed Binary | 3672 | 2505 |

General Linear | 4215 | 1668 |

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

Constraint % | 0.00272 | 0.0284093 | 0.0272465 | 0.119884 | |

Variable % | 0.00550 | 0.0289413 | 0.0274914 | 0.115464 | |

Score | 0.954242 |

No solution available for radiationm18-12-05 .

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

```
@Inbook{Belov2016,
author="Belov, Gleb
and Stuckey, Peter J.
and Tack, Guido
and Wallace, Mark",
editor="Rueher, Michel",
title="Improved Linearization of Constraint Programming Models",
bookTitle="Principles and Practice of Constraint Programming: 22nd International Conference, CP 2016, Toulouse, France, September 5-9, 2016, Proceedings",
year="2016",
publisher="Springer International Publishing",
pages="49--65",
isbn="978-3-319-44953-1",
doi="10.1007/978-3-319-44953-1_4",
url="http://dx.doi.org/10.1007/978-3-319-44953-1_4"
}
```

Last Update Mär 25, 2020 by Gabriel Kressin

generated with R Markdown

© 2019 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)

Imprint