mario-t-hard5i

indicator numerics aggregations precedence variable_bound set_partitioning set_packing invariant_knapsack mixed_binary general_linear

Submitter Variables Constraints Density Status Group Objective MPS File
Gleb Belov 73475 85190 3.80734e-05 easy mario -4482 mario-t-hard5i.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 73475 62747
Constraints 85190 83669
Binaries 31022 20908
Integers 30948 30843
Continuous 11505 10996
Implicit Integers 10320 10322
Fixed Variables 9910 0
Nonzero Density 3.80734e-05 4.45314e-05
Nonzeroes 238314 233789
Constraint Classification Properties
Original Presolved
Total 73970 72853
Empty 0 0
Free 0 0
Singleton 4 5
Aggregations 11313 11107
Precedence 20606 20004
Variable Bound 11122 11420
Set Partitioning 103 103
Set Packing 100 99
Set Covering 0 0
Cardinality 1 0
Invariant Knapsack 9802 9801
Equation Knapsack 1 0
Bin Packing 0 0
Knapsack 0 0
Integer Knapsack 0 0
Mixed Binary 1000 396
General Linear 19918 19918
Indicator 11220 11220

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.

## Warning in lapply(df["exactobjval"], as.numeric): NAs introduced by coercion
ID Objective Exact Int. Viol Cons. Viol Obj. Viol Submitter Date Description
1 -4482 0 0 0 - 2018-10-13 Solution found during MIPLIB2017 problem selection.

Similar instances in collection

The following instances are most similar to mario-t-hard5i 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
gfd-schedulen55f2d50m30k3i easy 90158 40622 42209 7327 129102 260992 Gleb Belov gfd-schedule 6 indicator numerics aggregations precedence variable_bound set_partitioning set_packing cardinality invariant_knapsack equation_knapsack mixed_binary general_linear
mspsphard03i easy 32266 18603 13663 0 56333 114618 Gleb Belov mspsp 30 indicator numerics aggregations precedence variable_bound set_packing set_covering invariant_knapsack binpacking knapsack mixed_binary general_linear
gfd-schedulen25f5d20m10k3i easy 30916 14783 14556 1577 47093 88245 Gleb Belov gfd-schedule 5 indicator numerics aggregations precedence variable_bound set_partitioning set_packing cardinality invariant_knapsack equation_knapsack mixed_binary general_linear
mspsphard01i easy 21531 10868 10663 0 32864 59860 Gleb Belov mspsp 35 indicator numerics aggregations precedence variable_bound set_packing invariant_knapsack general_linear
gfd-schedulen180f7d50m30k18-16i hard 2226625 1055523 1103442 67660 3447025 7026385 Gleb Belov gfd-schedule 47 indicator numerics aggregations precedence variable_bound set_partitioning set_packing cardinality invariant_knapsack equation_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 Mar 04, 2024 by Julian Manns
generated with R Markdown
© 2023 by Zuse Institute Berlin (ZIB)
Imprint