Submitter Variables Constraints Density Status Group Objective MPS File
Gleb Belov 32266 56333 6.30587e-05 easy mspsp 30 mspsphard03i.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 32266 31360
Constraints 56333 55067
Binaries 18603 18515
Integers 13663 12845
Continuous 0 0
Implicit Integers 8978 8160
Fixed Variables 82 0
Nonzero Density 6.30587e-05 6.46488e-05
Nonzeroes 114618 111642
Constraint Classification Properties
Original Presolved
Total 47355 46907
Empty 0 0
Free 0 0
Singleton 0 0
Aggregations 8839 8839
Precedence 18859 18859
Variable Bound 9073 9069
Set Partitioning 0 0
Set Packing 604 592
Set Covering 0 11
Cardinality 0 0
Invariant Knapsack 9380 8925
Equation Knapsack 0 0
Bin Packing 148 148
Knapsack 148 148
Integer Knapsack 0 0
Mixed Binary 0 12
General Linear 304 304
Indicator 8978 8978

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

Similar instances in collection

The following instances are most similar to mspsphard03i 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
mspsphard01i 21531 10868 10663 0 32864 59860 Gleb Belov mspsp easy 35
gfd-schedulen25f5d20m10k3i 30916 14783 14556 1577 47093 88245 Gleb Belov gfd-schedule easy 5
gfd-schedulen55f2d50m30k3i 90158 40622 42209 7327 129102 260992 Gleb Belov gfd-schedule easy 6
fjspeasy01i 17847 8849 8998 0 27264 46454 Gleb Belov fjsp easy 253
diameterc-mstc-v20a190d5i 10613 5053 4352 1208 19686 38503 Gleb Belov diameterc easy 414

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