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

Gleb Belov | 31237 | 42328 | 6.30646e-05 | hard | amaze | 0 | amaze22012-07-04i.mps.gz |

These are the instances from MiniZinc Challenges 2012-2016 (see www.minizinc.org), compiled for MIP *WITH INDICATOR CONSTRAINTS* using the develop branch of MiniZinc and CPLEX 12.7.1 on 30 April 2017. Thus, these instances can only be handled by solvers accepting indicator constraints. For instances compiled with big-M/domain decomposition only, see my previous submission to MIPLIB.To recompile, create a directory MODELS, a list lst12_16.txt of the instances with full paths to mzn/dzn files of each instance per line, and say$> ~/install/libmzn/tests/benchmarking/mzn-test.py -l ../lst12_16.txt --slvPrf MZN-CPLEX --debug 1 --addOption "--timeout 3 -D fIndConstr=true -D fMIPdomains=false" --useJoinedName "--writeModel MODELS_IND/%s.mps" Alternatively, you can compile individual instance as follows: $> mzn-cplex -v -s -G linear --output-time ../challenge_2012_2016/mznc2016_probs/zephyrus/zephyrus.mzn ../challenge_2012_2016/mznc2016_p/zephyrus/14__8__6__3.dzn -a --timeout 3 -D fIndConstr=true -D fMIPdomains=false --writeModel MODELS_IND/challenge_2012_2016mznc2016_probszephyruszephyrusmzn-challenge_2012_2016mznc2016_probszephyrus14__8__6__3dzn.mps

Detailed explanation of the following tables can be found here.

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

Variables | 31237 | 30588 |

Constraints | 42328 | 40990 |

Binaries | 10654 | 10600 |

Integers | 1603 | 1584 |

Continuous | 18980 | 18404 |

Implicit Integers | 885 | 971 |

Fixed Variables | 43 | 0 |

Nonzero Density | 6.30646e-05 | 6.11564e-05 |

Nonzeroes | 83384 | 76678 |

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

Total | 22657 | 21885 |

Empty | 0 | 0 |

Free | 0 | 0 |

Singleton | 22 | 217 |

Aggregations | 717 | 708 |

Precedence | 899 | 2157 |

Variable Bound | 1605 | 3383 |

Set Partitioning | 100 | 100 |

Set Packing | 0 | 0 |

Set Covering | 0 | 0 |

Cardinality | 91 | 86 |

Invariant Knapsack | 0 | 0 |

Equation Knapsack | 0 | 0 |

Bin Packing | 0 | 0 |

Knapsack | 0 | 0 |

Integer Knapsack | 0 | 5 |

Mixed Binary | 18786 | 14792 |

General Linear | 437 | 437 |

Indicator | 19671 | 19671 |

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.

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

1 | 0 | 1e+100 | 0 | 0 | 0 | Frederic Didier | 2020-01-22 | Solved with Google OR-tools using 8 Threads through generating subproblems by fixing part of the current solution and trying to solve them with a sub CP-SAT solver |

The following instances are most similar to amaze22012-07-04i 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.

```
@article{MZChPhil2010,
year={2010},
journal={Constraints},
volume={15},
number={3},
title={Philosophy of the {MiniZinc} challenge},
publisher={Springer US},
author={Stuckey, P. J. and Becket, R. and Fischer, J.},
pages={307--316},
}
@incollection{BelovEtAl_Lin16,
author="Belov, G.
and Stuckey, P. J.
and Tack, G.
and Wallace, M.",
editor="Rueher, M.",
title="Improved Linearization of Constraint Programming Models",
bookTitle="Principles and Practice of Constraint Programming: 22nd International Conference, CP 2016, Proceedings",
year="2016",
publisher="Springer International Publishing",
pages="49--65",
}
```

Last Update Aug 03, 2023 by Jan Krüger

generated with R Markdown

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

Imprint