shipschedule3shipsi

indicator numerics aggregations precedence variable_bound set_partitioning invariant_knapsack integer_knapsack mixed_binary general_linear

Submitter	Variables	Constraints	Density	Status	Group	Objective	MPS File
Gleb Belov	10513	16727	1.77668e-04	easy	shipschedule	-265650	shipschedule3shipsi.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	10513	10288
Constraints	16727	15142
Binaries	4817	4817
Integers	4343	4343
Continuous	1353	1128
Implicit Integers	2248	2399
Fixed Variables	0	0
Nonzero Density	0.000177668	0.000180208
Nonzeroes	31243	28073

Constraint Classification Properties
	Original	Presolved
Total	13579	12219
Empty	0	0
Free	0	0
Singleton	0	0
Aggregations	3136	3136
Precedence	4850	3638
Variable Bound	3833	3685
Set Partitioning	151	151
Set Packing	0	0
Set Covering	0	0
Cardinality	0	0
Invariant Knapsack	844	844
Equation Knapsack	0	0
Bin Packing	0	0
Knapsack	0	0
Integer Knapsack	74	74
Mixed Binary	453	453
General Linear	238	238
Indicator	3148	3148

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

Similar instances in collection

The following instances are most similar to shipschedule3shipsi 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
shipschedule6shipsmixi	easy	18770	10310	7104	1356	27823	55903	Gleb Belov	shipschedule	-301650	indicator numerics aggregations precedence variable_bound set_partitioning invariant_knapsack integer_knapsack mixed_binary general_linear
shipschedule8shipsmixuci	easy	25206	13635	9763	1808	37821	75480	Gleb Belov	shipschedule	-389100	indicator numerics aggregations precedence variable_bound set_partitioning invariant_knapsack integer_knapsack mixed_binary general_linear
fjspeasy01i	easy	17847	8849	8998	0	27264	46454	Gleb Belov	fjsp	253	indicator numerics aggregations precedence variable_bound set_packing invariant_knapsack general_linear
diameterc-mstc-v20a190d5i	easy	10613	5053	4352	1208	19686	38503	Gleb Belov	diameterc	414	indicator numerics aggregations precedence variable_bound set_partitioning cardinality invariant_knapsack mixed_binary general_linear
rocI-3-11	easy	5132	3894	762	476	8165	20540	Joerg Rambau	rocI	-50403	numerics aggregations precedence variable_bound set_partitioning 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",
}