rpp22falsei

feasibility indicator numerics aggregations precedence variable_bound set_partitioning set_covering invariant_knapsack mixed_binary general_linear

Submitter	Variables	Constraints	Density	Status	Group	Objective	MPS File
Gleb Belov	25462	33269	6.6754e-05	easy	rpp	0	rpp22falsei.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	25462	25152
Constraints	33269	32959
Binaries	10276	10276
Integers	15056	14746
Continuous	130	130
Implicit Integers	8610	8301
Fixed Variables	0	0
Nonzero Density	6.67540e-05	6.74644e-05
Nonzeroes	56547	55927

Constraint Classification Properties
	Original	Presolved
Total	24573	24573
Empty	0	0
Free	0	0
Singleton	0	0
Aggregations	7164	7164
Precedence	3193	3171
Variable Bound	8738	8760
Set Partitioning	1	1
Set Packing	0	0
Set Covering	0	210
Cardinality	0	0
Invariant Knapsack	1743	1533
Equation Knapsack	0	0
Bin Packing	0	0
Knapsack	0	0
Integer Knapsack	0	0
Mixed Binary	86	86
General Linear	3648	3648
Indicator	8696	8696

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 rpp22falsei .

Similar instances in collection

The following instances are most similar to rpp22falsei 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
oocsp-racks030e6cci	easy	50862	32783	18079	0	92737	232944	Gleb Belov	oocsp-racks	0	feasibility indicator numerics aggregations precedence variable_bound set_partitioning set_covering cardinality invariant_knapsack integer_knapsack general_linear
oocsp-racks030f7cci	easy	50859	32779	18080	0	92792	233170	Gleb Belov	oocsp-racks	Infeasible	infeasible feasibility indicator numerics aggregations precedence variable_bound set_partitioning set_covering cardinality invariant_knapsack integer_knapsack 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
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

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",
}