Submitter Variables Constraints Density Status Group Objective MPS File
Gleb Belov 317369 30784 6.56503e-05 hard l2p 6 l2p1i.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 317369 316990
Constraints 30784 30173
Binaries 301560 301504
Integers 15689 15486
Continuous 120 0
Implicit Integers 7902 7897
Fixed Variables 120 0
Nonzero Density 6.56503e-05 6.69270e-05
Nonzeroes 641396 640126
Constraint Classification Properties
Original Presolved
Total 22882 22474
Empty 0 0
Free 0 0
Singleton 120 0
Aggregations 2100 2100
Precedence 2463 2151
Variable Bound 8190 8215
Set Partitioning 198 198
Set Packing 13 12
Set Covering 0 0
Cardinality 1885 1885
Invariant Knapsack 120 120
Equation Knapsack 0 0
Bin Packing 0 0
Knapsack 0 0
Integer Knapsack 0 0
Mixed Binary 0 0
General Linear 7793 7793
Indicator 7902 7902

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

Similar instances in collection

The following instances are most similar to l2p1i 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
gfd-schedulen55f2d50m30k3i 90158 40622 42209 7327 129102 260992 Gleb Belov gfd-schedule easy 6
mspsphard03i 32266 18603 13663 0 56333 114618 Gleb Belov mspsp easy 30
diameterc-mstc-v20a190d5i 10613 5053 4352 1208 19686 38503 Gleb Belov diameterc easy 414
diameterc-msts-v40a100d5i 14629 5611 5304 3714 21131 40288 Gleb Belov diameterc easy 729
mspsphard01i 21531 10868 10663 0 32864 59860 Gleb Belov mspsp easy 35

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