mappingmesh3x3mpeg2i

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	10470	17055	1.86363e-04	easy	mapping	905	mappingmesh3x3mpeg2i.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	10470	10209
Constraints	17055	13430
Binaries	4739	4739
Integers	4369	4369
Continuous	1362	1101
Implicit Integers	2320	2342
Fixed Variables	0	0
Nonzero Density	0.000186363	0.000189837
Nonzeroes	33278	26028

Constraint Classification Properties
	Original	Presolved
Total	13709	10371
Empty	0	0
Free	0	0
Singleton	0	0
Aggregations	3059	3059
Precedence	3643	279
Variable Bound	5945	5945
Set Partitioning	74	20
Set Packing	0	0
Set Covering	0	0
Cardinality	4	58
Invariant Knapsack	0	0
Equation Knapsack	0	0
Bin Packing	0	0
Knapsack	0	0
Integer Knapsack	27	53
Mixed Binary	531	531
General Linear	426	426
Indicator	3373	3373

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)

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

Similar instances in collection

The following instances are most similar to mappingmesh3x3mpeg2i 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
physiciansched3-4	easy	74119	65900	0	8219	239780	908634	Pelin Damci-Kurt	physiciansched	1480386.746666666	aggregations precedence variable_bound set_packing set_covering invariant_knapsack binpacking knapsack mixed_binary general_linear
physiciansched5-3	easy	14488	11501	0	2987	31925	156378	Pelin Damci-Kurt	physiciansched	21100	decomposition benchmark_suitable precedence variable_bound set_packing set_covering invariant_knapsack binpacking mixed_binary
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
elitserienhandball14i	hard	32541	16938	6938	8665	35328	98685	Gleb Belov	elitserienhandball	2	indicator numerics aggregations precedence variable_bound set_partitioning set_packing set_covering cardinality invariant_knapsack equation_knapsack mixed_binary general_linear
elitserienhandball11i	hard	32679	16944	6952	8783	35580	99071	Gleb Belov	elitserienhandball	3	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",
}