splice1k1i

indicator numerics aggregations precedence variable_bound general_linear

Submitter Variables Constraints Density Status Group Objective MPS File
Gleb Belov 19513 22765 4.00827e-03 hard splice -394 splice1k1i.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 19513 19513
Constraints 22765 22765
Binaries 6504 6504
Integers 13009 13009
Continuous 0 0
Implicit Integers 6504 12889
Fixed Variables 0 0
Nonzero Density 0.00400827 0.00400827
Nonzeroes 1780530 1780530
Constraint Classification Properties
Original Presolved
Total 16261 16261
Empty 0 0
Free 0 0
Singleton 0 0
Aggregations 3252 3252
Precedence 0 6384
Variable Bound 6504 120
Set Partitioning 0 0
Set Packing 0 0
Set Covering 0 0
Cardinality 0 0
Invariant Knapsack 0 0
Equation Knapsack 0 0
Bin Packing 0 0
Knapsack 0 0
Integer Knapsack 0 0
Mixed Binary 0 0
General Linear 6505 6505
Indicator 6504 6504

Structure

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

value min median mean max
Components 3.512284
Constraint % 0.0219635 0.0219635 0.0219635 0.0219635
Variable % 0.0307487 0.0307487 0.0307487 0.0307487
Score 0.714035

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

Similar instances in collection

The following instances are most similar to splice1k1i 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 Status Variables Binaries Integers Continuous Constraints Nonz. Submitter Group Objective Tags
k1mushroomi easy 48104 16419 31685 0 56312 1666560 Gleb Belov k1mushroom -3288 indicator numerics aggregations precedence variable_bound general_linear
shipschedule8shipsmixuci easy 25206 13635 9763 1808 37821 75480 Gleb Belov shipschedule -389100 indicator numerics aggregations precedence variable_bound set_partitioning invariant_knapsack integer_knapsack mixed_binary general_linear
shipschedule6shipsmixi easy 18770 10310 7104 1356 27823 55903 Gleb Belov shipschedule -301650 indicator numerics aggregations precedence variable_bound set_partitioning invariant_knapsack integer_knapsack mixed_binary general_linear
shipschedule3shipsi easy 10513 4817 4343 1353 16727 31243 Gleb Belov shipschedule -265650 indicator numerics aggregations precedence variable_bound set_partitioning invariant_knapsack integer_knapsack mixed_binary general_linear
supportcase34 easy 17879 11196 6682 1 15170 748887 Domenico Salvagnin 83.99999986 benchmark_suitable aggregations precedence variable_bound set_partitioning cardinality invariant_knapsack knapsack integer_knapsack mixed_binary general_linear

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