Submitter Variables Constraints Density Status Group Objective MPS File
Gleb Belov 38196 47653 4.68136e-05 open l2p NA l2p2i.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 38196 37725
Constraints 47653 46915
Binaries 13113 13032
Integers 24938 24693
Continuous 145 0
Implicit Integers 12538 12309
Fixed Variables 145 0
Nonzero Density 4.68136e-05 4.72544e-05
Nonzeroes 85208 83634
Constraint Classification Properties
Original Presolved
Total 35115 34622
Empty 0 0
Free 0 0
Singleton 145 0
Aggregations 4188 4188
Precedence 3413 3036
Variable Bound 12886 12916
Set Partitioning 16 16
Set Packing 16 15
Set Covering 0 0
Cardinality 3025 3025
Invariant Knapsack 145 145
Equation Knapsack 0 0
Bin Packing 0 0
Knapsack 0 0
Integer Knapsack 0 0
Mixed Binary 0 0
General Linear 11281 11281
Indicator 12538 12538

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

Similar instances in collection

The following instances are most similar to l2p2i 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
ghoulomb4-9-10i 43424 15590 27834 0 56330 118062 Gleb Belov ghoulomb easy 44
gfd-schedulen55f2d50m30k3i 90158 40622 42209 7327 129102 260992 Gleb Belov gfd-schedule easy 6
mrcpspj30-17-10i 26381 7386 10901 8094 34490 62166 Gleb Belov mrcpspj easy 26
mrcpspj30-15-5i 24376 6192 8921 9263 32659 56963 Gleb Belov mrcpspj easy 24
pizza27i 311316 115831 195485 0 359835 642512 Gleb Belov pizza open 773290*

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