Submitter Variables Constraints Density Status Group Objective MPS File
Gleb Belov 90158 129102 2.24228e-05 easy gfd-schedule 6 gfd-schedulen55f2d50m30k3i.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 90158 87264
Constraints 129102 126441
Binaries 40622 39067
Integers 42209 41090
Continuous 7327 7107
Implicit Integers 21247 20397
Fixed Variables 80 0
Nonzero Density 2.24228e-05 2.28235e-05
Nonzeroes 260992 251829
Constraint Classification Properties
Original Presolved
Total 100745 99318
Empty 0 0
Free 0 0
Singleton 28 65
Aggregations 11802 11747
Precedence 26742 25791
Variable Bound 22695 22830
Set Partitioning 197 193
Set Packing 110 110
Set Covering 0 0
Cardinality 32 32
Invariant Knapsack 12081 12055
Equation Knapsack 3 2
Bin Packing 0 0
Knapsack 0 0
Integer Knapsack 0 0
Mixed Binary 7110 6550
General Linear 19945 19943
Indicator 28357 28357

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 gfd-schedulen55f2d50m30k3i .

Similar instances in collection

The following instances are most similar to gfd-schedulen55f2d50m30k3i 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-schedulen25f5d20m10k3i 30916 14783 14556 1577 47093 88245 Gleb Belov gfd-schedule easy 5
mspsphard03i 32266 18603 13663 0 56333 114618 Gleb Belov mspsp easy 30
mspsphard01i 21531 10868 10663 0 32864 59860 Gleb Belov mspsp easy 35
gfd-schedulen180f7d50m30k18-16i 2226625 1055523 1103442 67660 3447025 7026380 Gleb Belov gfd-schedule open
ghoulomb4-9-10i 43424 15590 27834 0 56330 118062 Gleb Belov ghoulomb easy 44

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