oocsp-racks030e6cci

feasibility indicator numerics aggregations precedence variable_bound set_partitioning set_covering cardinality invariant_knapsack integer_knapsack general_linear

Submitter	Variables	Constraints	Density	Status	Group	Objective	MPS File
Gleb Belov	50862	92737	4.93861e-05	easy	oocsp-racks	0	oocsp-racks030e6cci.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	50862	48932
Constraints	92737	91071
Binaries	32783	31485
Integers	18079	17447
Continuous	0	0
Implicit Integers	11460	11091
Fixed Variables	1381	0
Nonzero Density	4.93861e-05	5.15227e-05
Nonzeroes	232944	229600

Constraint Classification Properties
	Original	Presolved
Total	81278	80131
Empty	0	0
Free	0	0
Singleton	0	240
Aggregations	5824	5824
Precedence	27766	27046
Variable Bound	17376	16714
Set Partitioning	150	150
Set Packing	0	0
Set Covering	0	4470
Cardinality	1740	1740
Invariant Knapsack	23775	19305
Equation Knapsack	0	0
Bin Packing	0	0
Knapsack	0	0
Integer Knapsack	7	6
Mixed Binary	0	0
General Linear	4640	4636
Indicator	11460	11460

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 oocsp-racks030e6cci .

Similar instances in collection

The following instances are most similar to oocsp-racks030e6cci 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-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
rpp22falsei	easy	25462	10276	15056	130	33269	56547	Gleb Belov	rpp	0	feasibility indicator numerics aggregations precedence variable_bound set_partitioning set_covering invariant_knapsack mixed_binary general_linear
gfd-schedulen180f7d50m30k18	hard	227535	192408	2025	33102	457985	1233372	Gleb Belov	gfd-schedule	1	benchmark feasibility benchmark_suitable aggregations precedence variable_bound set_partitioning cardinality invariant_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

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