Submitter Variables Constraints Density Status Group Objective MPS File
Gleb Belov 10613 19686 1.84289e-04 easy diameterc 414 diameterc-mstc-v20a190d5i.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 10613 10533
Constraints 19686 18666
Binaries 5053 5013
Integers 4352 4352
Continuous 1208 1168
Implicit Integers 2584 2608
Fixed Variables 40 0
Nonzero Density 0.000184289 0.000185083
Nonzeroes 38503 36389
Constraint Classification Properties
Original Presolved
Total 16150 15168
Empty 0 0
Free 0 0
Singleton 2 0
Aggregations 1250 1250
Precedence 7211 6269
Variable Bound 3564 3602
Set Partitioning 23 23
Set Packing 0 0
Set Covering 0 0
Cardinality 401 401
Invariant Knapsack 1121 1121
Equation Knapsack 0 0
Bin Packing 0 0
Knapsack 0 0
Integer Knapsack 0 0
Mixed Binary 954 878
General Linear 1624 1624
Indicator 3536 3536

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)

No solution available for diameterc-mstc-v20a190d5i .

Similar instances in collection

The following instances are most similar to diameterc-mstc-v20a190d5i 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
diameterc-msts-v40a100d5i 14629 5611 5304 3714 21131 40288 Gleb Belov diameterc easy 729
fjspeasy01i 17847 8849 8998 0 27264 46454 Gleb Belov fjsp easy 253
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
mrcpspj30-15-5i 24376 6192 8921 9263 32659 56963 Gleb Belov mrcpspj easy 24

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