stoch-vrpvrp-s5v2c8vrp-v2c8i

indicator numerics aggregations precedence variable_bound set_partitioning set_packing mixed_binary general_linear

Submitter	Variables	Constraints	Density	Status	Group	Objective	MPS File
Gleb Belov	8436	13813	2.25108e-04	hard	vrp	329.9999999999999	stoch-vrpvrp-s5v2c8vrp-v2c8i.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	8436	7087
Constraints	13813	12314
Binaries	1485	1300
Integers	734	734
Continuous	6217	5053
Implicit Integers	180	280
Fixed Variables	34	0
Nonzero Density	0.000225108	0.000224901
Nonzeroes	26231	19627

Constraint Classification Properties
	Original	Presolved
Total	8493	7934
Empty	0	0
Free	0	0
Singleton	154	370
Aggregations	1213	1123
Precedence	310	1470
Variable Bound	360	1700
Set Partitioning	100	105
Set Packing	100	100
Set Covering	0	0
Cardinality	5	0
Invariant Knapsack	20	0
Equation Knapsack	0	0
Bin Packing	0	0
Knapsack	0	0
Integer Knapsack	0	0
Mixed Binary	5190	2140
General Linear	1041	926
Indicator	5320	5320

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
2	330		0	0	0	Hans Mittelmann	2019-12-21	Solved with Gurobi 9.0 using 32 Threads within 88 hours
1	330		0	0	0	-	2018-10-13	Solution found during MIPLIB2017 problem selection.

Similar instances in collection

The following instances are most similar to stoch-vrpvrp-s5v2c8vrp-v2c8i 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-06-28i	easy	12691	4376	914	7401	17319	33831	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
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
elitserienhandball13i	hard	32791	16976	6976	8839	35758	99381	Gleb Belov	elitserienhandball	5	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",
}