amaze22012-06-28i

feasibility indicator numerics aggregations precedence variable_bound set_partitioning cardinality integer_knapsack mixed_binary general_linear

Submitter	Variables	Constraints	Density	Status	Group	Objective	MPS File
Gleb Belov	12691	17319	1.5392e-04	easy	amaze	0	amaze22012-06-28i.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

Location of instance in collection

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
	Original	Presolved
Variables	12691	12120
Constraints	17319	16358
Binaries	4376	4316
Integers	914	892
Continuous	7401	6912
Implicit Integers	504	552
Fixed Variables	49	0
Nonzero Density	0.000153920	0.000147282
Nonzeroes	33831	29200

Constraint Classification Properties
	Original	Presolved
Total	9535	9055
Empty	0	0
Free	0	0
Singleton	25	280
Aggregations	420	411
Precedence	528	1352
Variable Bound	928	2048
Set Partitioning	61	61
Set Packing	0	0
Set Covering	0	0
Cardinality	53	46
Invariant Knapsack	0	0
Equation Knapsack	0	0
Bin Packing	0	0
Knapsack	0	0
Integer Knapsack	0	9
Mixed Binary	7280	4608
General Linear	240	240
Indicator	7784	7784

Structure

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

Nonzero entries of original problem

Nonzero entries after trivial presolving

Decomposed structure of original problem (dec-file)

Decomposed structure after trivial presolving (dec-file)

	value	min	median	mean	max
Components
Constraint %
Variable %
Score

Best Known Solution(s)

No solution available for amaze22012-06-28i .

Similar instances in collection

The following instances are most similar to amaze22012-06-28i 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
amaze22012-03-15i	easy	94351	31870	2770	59711	126975	251822	Gleb Belov	amaze	0	feasibility indicator numerics aggregations precedence variable_bound set_partitioning cardinality equation_knapsack integer_knapsack mixed_binary general_linear
amaze22012-07-04i	hard	31237	10654	1603	18980	42328	83384	Gleb Belov	amaze	0	feasibility indicator numerics aggregations precedence variable_bound set_partitioning cardinality integer_knapsack mixed_binary general_linear
fillomino7x7-0i	easy	12877	4821	4443	3613	17518	33300	Gleb Belov	fillomino	0	feasibility indicator numerics aggregations precedence variable_bound set_partitioning cardinality invariant_knapsack mixed_binary general_linear
stoch-vrpvrp-s5v2c8vrp-v2c8i	hard	8436	1485	734	6217	13813	26231	Gleb Belov	vrp	329.9999999999999	indicator numerics aggregations precedence variable_bound set_partitioning set_packing mixed_binary general_linear
elitserienhandball3i	hard	32807	16966	6973	8868	35804	99434	Gleb Belov	elitserienhandball	4	indicator numerics aggregations precedence variable_bound set_partitioning set_packing set_covering 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",
}