Submitter Variables Constraints Density Status Group Objective MPS File
Gleb Belov 24376 32659 7.15529e-05 easy mrcpspj 24 mrcpspj30-15-5i.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

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 24376 21982
Constraints 32659 30643
Binaries 6192 5819
Integers 8921 8916
Continuous 9263 7247
Implicit Integers 3480 3587
Fixed Variables 22 0
Nonzero Density 7.15529e-05 7.68534e-05
Nonzeroes 56963 51768
Constraint Classification Properties
Original Presolved
Total 22036 21995
Empty 0 0
Free 0 0
Singleton 41 0
Aggregations 4750 4818
Precedence 3487 3722
Variable Bound 5220 5455
Set Partitioning 171 138
Set Packing 0 0
Set Covering 0 0
Cardinality 1 0
Invariant Knapsack 870 870
Equation Knapsack 0 0
Bin Packing 0 0
Knapsack 0 0
Integer Knapsack 62 62
Mixed Binary 3756 3286
General Linear 3678 3644
Indicator 10623 10623

Structure

Available nonzero structure and decomposition information. Further information can be found here.

value min median mean max
Components
Constraint %
Variable %
Score

Best Known Solution(s)

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

Similar instances in collection

The following instances are most similar to mrcpspj30-15-5i 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 Variables Binaries Integers Continuous Constraints Nonz. Submitter Group Status Objective
mrcpspj30-17-10i 26381 7386 10901 8094 34490 62166 Gleb Belov mrcpspj easy 26
mrcpspj30-53-3i 24220 6020 8938 9262 32618 56796 Gleb Belov mrcpspj easy 34
diameterc-msts-v40a100d5i 14629 5611 5304 3714 21131 40288 Gleb Belov diameterc easy 729
elitserienhandball3i 32807 16966 6973 8868 35804 99434 Gleb Belov elitserienhandball open 6*
elitserienhandball13i 32791 16976 6976 8839 35758 99381 Gleb Belov elitserienhandball open 9*

Reference

@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 Nov 17, 2018 by Gregor Hendel
generated with R Markdown
© 2018 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint