Submitter Variables Constraints Density Status Group Objective MPS File
Gleb Belov 25206 37821 7.91763e-05 easy shipschedule -389100 shipschedule8shipsmixuci.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 25206 24898
Constraints 37821 34787
Binaries 13635 13635
Integers 9763 9759
Continuous 1808 1504
Implicit Integers 5306 6124
Fixed Variables 8 0
Nonzero Density 7.91763e-05 8.01453e-05
Nonzeroes 75480 69416
Constraint Classification Properties
Original Presolved
Total 31315 28581
Empty 0 0
Free 0 0
Singleton 4 0
Aggregations 6238 6238
Precedence 11784 9868
Variable Bound 8336 7522
Set Partitioning 818 818
Set Packing 0 0
Set Covering 0 0
Cardinality 0 0
Invariant Knapsack 2282 2282
Equation Knapsack 0 0
Bin Packing 0 0
Knapsack 0 0
Integer Knapsack 148 148
Mixed Binary 604 604
General Linear 1101 1101
Indicator 6506 6506

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

Similar instances in collection

The following instances are most similar to shipschedule8shipsmixuci 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
shipschedule6shipsmixi 18770 10310 7104 1356 27823 55903 Gleb Belov shipschedule easy -301650
shipschedule3shipsi 10513 4817 4343 1353 16727 31243 Gleb Belov shipschedule easy -265650
rocI-3-11 5132 3894 762 476 8165 20540 Joerg Rambau rocI easy -50403
fjspeasy01i 17847 8849 8998 0 27264 46454 Gleb Belov fjsp easy 253
rocI-4-11 6839 5192 1016 631 10883 27383 Joerg Rambau rocI easy -6020203

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