pizza27i

indicator numerics aggregations precedence variable_bound set_partitioning cardinality binpacking general_linear

Submitter Variables Constraints Density Status Group Objective MPS File
Gleb Belov 311316 359835 5.73557e-06 open pizza 701882* pizza27i.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 311316 295207
Constraints 359835 359115
Binaries 115831 99722
Integers 195485 195485
Continuous 0 0
Implicit Integers 97742 97922
Fixed Variables 16109 0
Nonzero Density 5.73557e-06 6.04709e-06
Nonzeroes 642512 641072
Constraint Classification Properties
Original Presolved
Total 262093 261373
Empty 0 0
Free 0 0
Singleton 0 0
Aggregations 33662 33662
Precedence 720 180
Variable Bound 114571 114391
Set Partitioning 180 180
Set Packing 0 0
Set Covering 0 0
Cardinality 16109 16109
Invariant Knapsack 0 0
Equation Knapsack 0 0
Bin Packing 8 8
Knapsack 0 0
Integer Knapsack 0 0
Mixed Binary 0 0
General Linear 96843 96843
Indicator 97742 97742

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
2 701882 0 0 0 Robert Ashford and Alkis Vazacopoulus 2019-12-18 Found using ODH|CPlex
1 773290 0 0 0 - 2018-10-13 Solution found during MIPLIB2017 problem selection.

Similar instances in collection

The following instances are most similar to pizza27i 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
pizza78i open 385067 143886 241181 0 443776 796615 Gleb Belov pizza 564039* indicator numerics aggregations precedence variable_bound set_partitioning cardinality binpacking general_linear
ghoulomb4-9-10i easy 43424 15590 27834 0 56330 118062 Gleb Belov ghoulomb 44 indicator numerics aggregations precedence variable_bound invariant_knapsack integer_knapsack general_linear
mrcpspj30-17-10i easy 26381 7386 10901 8094 34490 62166 Gleb Belov mrcpspj 26 indicator numerics aggregations precedence variable_bound set_partitioning invariant_knapsack integer_knapsack mixed_binary general_linear
l2p2i easy 38196 13113 24938 145 47653 85208 Gleb Belov l2p 8 indicator numerics aggregations precedence variable_bound set_partitioning set_packing cardinality invariant_knapsack general_linear
mrcpspj30-15-5i easy 24376 6192 8921 9263 32659 56963 Gleb Belov mrcpspj 24 indicator numerics aggregations precedence variable_bound set_partitioning invariant_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 Mar 04, 2024 by Julian Manns
generated with R Markdown
© 2023 by Zuse Institute Berlin (ZIB)
Imprint