Instance - supportcase20


	Raw This is the CCM image before the decomposition procedure has been applied.	Decomposed This is the CCM image after a decomposition procedure has been applied. This is the image used by the MIC's image-based comparisons for this query instance.	Composite of MIC Top 5 Composite of the five decomposed CCM images from the MIC Top 5.	Composite of MIPLIB Top 5 Composite of the five decomposed CCM images from the MIPLIB Top 5.	Model Group Composite Image Composite of the decomposed CCM images for every instance in the same model group as this query.

Decomposed These decomposed images were created by GCG.
Name	fhnw-sq2 [MIPLIB]	fhnw-sq3 [MIPLIB]	khb05250 [MIPLIB]	bharat [MIPLIB]	neos-3421095-cinca [MIPLIB]
Rank / ISS The image-based structural similarity (ISS) metric measures the Euclidean distance between the image-based feature vectors for the query instance and all other instances. A smaller ISS value indicates greater similarity.	1 / 1.053	2 / 1.067	3 / 1.076	4 / 1.077	5 / 1.166
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIC top 5.

Decomposed These decomposed images were created by GCG.
Name	dg012142 [MIPLIB]	dano3_5 [MIPLIB]	dano3_3 [MIPLIB]	dano3mip [MIPLIB]	set3-09* [MIPLIB]
Rank / ISS The image-based structural similarity (ISS) metric measures the Euclidean distance between the image-based feature vectors for the query instance and all model groups. A smaller ISS value indicates greater similarity.	459 / 1.798	932 / 2.661	933 / 2.663	936 / 2.688	280* / 1.685*
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIPLIB top 5.

Instance Summary

The table below contains summary information for supportcase20, the five most similar instances to supportcase20 according to the MIC, and the five most similar instances to supportcase20 according to MIPLIB 2017.

	INSTANCE	SUBMITTER	DESCRIPTION	ISS	RANK
Parent Instance	supportcase20 [MIPLIB]	Michael Winkler	MIP instances collected from Gurobi forum with unknown application	0.000000	-
MIC Top 5	fhnw-sq2 [MIPLIB]	Simon Felix	Combinatorial toy fesability problem: Magic square. Instances 1 & 2 are feasible, instance 3 is unknown. Reported to be solved after 46883 seconds with ParaSCIP using 72 cores.	1.052668	1
	fhnw-sq3 [MIPLIB]	Simon Felix	Combinatorial toy fesability problem: Magic square. Instances 1 & 2 are feasible, instance 3 is unknown.	1.067300	2
	khb05250 [MIPLIB]	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	1.075790	3
	bharat [MIPLIB]	Gavin Goodall	MILP for optimizing fuel use at a forward operating base	1.076880	4
	neos-3421095-cinca [MIPLIB]	Jeff Linderoth	(None provided)	1.165874	5
MIPLIB Top 5	dg012142 [MIPLIB]	A. Miller	Multilevel lot-sizing instance This instance was solved by using 256 cores of the distributed-memory supercomputer Fujitsu PRIMERGY RX200S5 (http://www.ism.ac.jp/computer_system/eng/sc/super.html). The problem was solved by ParaSCIP in approximately 43 hours.	1.798321	459
	dano3_5 [MIPLIB]	Daniel Bienstock	Telecommunications applications	2.661098	932
	dano3_3 [MIPLIB]	Daniel Bienstock	Telecommunications applications	2.662535	933
	dano3mip [MIPLIB]	Daniel Bienstock	Telecommunications applications	2.688379	936
	set3-09* [MIPLIB]	Kerem Akartunali	This is joint work with Andrew J. Miller, Universite de Bordeaux 1; RealOpt, INRIA Bordeaux Sud-Ouest, France. Andrew.Miller@math.u-bordeaux1.fr. These are five hard instances chosen from our library MULTILSB (Multi-item Lot-Sizing with Backlogging), which is fully available at (incl. documentation and mosel file):http://personal.strath.ac.uk/kerem.akartunali/research/multi-lsb/ For these 5 instances, gaps remain in the range of >50% after 30 min. (using latest version of FICO on a laptop with i7 processor and 4GB RAM): (first two columns indicate the 30 min-runs, and the last column indicates the best solutions we know at the moment). Computational results for these instances as well as for others of MULTILSB can be found on the website.	1.685459*	280*

These are model group composite (MGC) images for the MIC top 5 model groups.
Name	fhnw-sq	pfour	rpp	neos-pseudoapplication-74	scp
Rank / ISS The image-based structural similarity (ISS) metric measures the Euclidean distance between the image-based feature vectors for the query instance and all other instances. A smaller ISS value indicates greater similarity.	1 / 1.469	2 / 1.676	3 / 1.731	4 / 1.734	5 / 1.748

Model Group Summary

The table below contains summary information for the five most similar model groups to supportcase20 according to the MIC.

	MODEL GROUP	SUBMITTER	DESCRIPTION	ISS	RANK
MIC Top 5	fhnw-sq	Simon Felix	Combinatorial toy fesability problem: Magic square. Models 1 & 2 are feasible, model 3 is unknown.	1.468720	1
	pfour	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	1.675704	2
	rpp	Gleb Belov	These are the models 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 models can only be handled by solvers accepting indicator constraints. For models 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 models with full paths to mzn/dzn files of each model 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 model 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	1.731061	3
	neos-pseudoapplication-74	Jeff Linderoth	(None provided)	1.734052	4
	scp	Shunji Umetani	This is a random test model generator for SCP using the scheme of the following paper, namely the column cost c[j] are integer randomly generated from [1,100]; every column covers at least one row; and every row is covered by at least two columns. see reference: E. Balas and A. Ho, Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study, Mathematical Programming, 12 (1980), 37-60. We have newly generated Classes I-N with the following parameter values, where each class has five models. We have also generated reduced models by a standard pricing method in the following paper: S. Umetani and M. Yagiura, Relaxation heuristics for the set covering problem, Journal of the Operations Research Society of Japan, 50 (2007), 350-375. You can obtain the model generator program from the following web site. https://sites.google.com/site/shunjiumetani/benchmark	1.747615	5

Type:	Instance
Submitter:	Michael Winkler
Description:	MIP instances collected from Gurobi forum with unknown application
	MIPLIB Entry

Model Group Assignment from MIPLIB:	no model group assignment
Assigned Model Group Rank/ISS in the MIC:	N.A. / N.A.

supportcase20: Instance-to-Instance Comparison Results

Parent Instance (supportcase20)

MIC Top 5 Instances

MIPLIB Top 5 Instances

Instance Summary

supportcase20: Instance-to-Model Comparison Results

MIC Top 5 Model Groups

Model Group Summary