Submitter Variables Constraints Density Status Group Objective MPS File
Gleb Belov 17847 27264 9.54703e-05 easy fjsp 253 fjspeasy01i.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 17847 17847
Constraints 27264 27210
Binaries 8849 8849
Integers 8998 8998
Continuous 0 0
Implicit Integers 5882 5882
Fixed Variables 0 0
Nonzero Density 9.54703e-05 9.54374e-05
Nonzeroes 46454 46346
Constraint Classification Properties
Original Presolved
Total 21382 21328
Empty 0 0
Free 0 0
Singleton 0 0
Aggregations 5814 5814
Precedence 5934 5880
Variable Bound 5974 5974
Set Partitioning 0 0
Set Packing 496 496
Set Covering 0 0
Cardinality 0 0
Invariant Knapsack 2931 2931
Equation Knapsack 0 0
Bin Packing 0 0
Knapsack 0 0
Integer Knapsack 0 0
Mixed Binary 0 0
General Linear 233 233
Indicator 5882 5882

Structure

Available nonzero structure and decomposition information. Further information can be found here.

value min median mean max
Components 0.9542425
Constraint % 0.521867 12.1651 0.540243 63.1018
Variable % 0.655572 12.4951 0.689191 64.2853
Score 0.4693100

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

Similar instances in collection

The following instances are most similar to fjspeasy01i 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
mrcpspj30-17-10i 26381 7386 10901 8094 34490 62166 Gleb Belov mrcpspj easy 26
diameterc-mstc-v20a190d5i 10613 5053 4352 1208 19686 38503 Gleb Belov diameterc easy 414
mspsphard01i 21531 10868 10663 0 32864 59860 Gleb Belov mspsp easy 35
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 19, 2018 by Gregor Hendel
generated with R Markdown
© 2018 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint