gfd-schedulen180f7d50m30k18-16i

indicator numerics aggregations precedence variable_bound set_partitioning set_packing cardinality invariant_knapsack equation_knapsack mixed_binary general_linear

Submitter	Variables	Constraints	Density	Status	Group	Objective	MPS File
Gleb Belov	2226625	3447025	9.15462e-07	hard	gfd-schedule	47	gfd-schedulen180f7d50m30k18-16i.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	2226625	2194222
Constraints	3447025	3423384
Binaries	1055523	1039166
Integers	1103442	1087454
Continuous	67660	67602
Implicit Integers	554014	539282
Fixed Variables	513	0
Nonzero Density	9.15462e-07	9.24710e-07
Nonzeroes	7026380	6946120

Constraint Classification Properties
	Original	Presolved
Total	2826053	2817916
Empty	0	0
Free	0	0
Singleton	23	416
Aggregations	286596	286389
Precedence	914395	907019
Variable Bound	563193	562526
Set Partitioning	739	736
Set Packing	1260	1260
Set Covering	0	0
Cardinality	88	88
Invariant Knapsack	451596	451555
Equation Knapsack	18	19
Bin Packing	0	0
Knapsack	0	0
Integer Knapsack	0	0
Mixed Binary	66958	66724
General Linear	541187	541184
Indicator	620972	620972

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	47		0	0	0	Robert Bixby	2020-02-21	Solved with Gurobi 9.0 within 18 hours
1	47		0	0	0	Frederic Didier	2020-01-22	Solved with Google OR-tools using 8 Threads through generating subproblems by fixing part of the current solution and trying to solve them with a sub CP-SAT solver

Similar instances in collection

The following instances are most similar to gfd-schedulen180f7d50m30k18-16i 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
gfd-schedulen55f2d50m30k3i	easy	90158	40622	42209	7327	129102	260992	Gleb Belov	gfd-schedule	6	indicator numerics aggregations precedence variable_bound set_partitioning set_packing cardinality invariant_knapsack equation_knapsack mixed_binary general_linear
mario-t-hard5i	easy	73475	31022	30948	11505	85190	238314	Gleb Belov	mario	-4482	indicator numerics aggregations precedence variable_bound set_partitioning set_packing 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
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",
}