Instance - supportcase33


	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	scpl4 [MIPLIB]	scpm1 [MIPLIB]	gen-ip021 [MIPLIB]	gen-ip036 [MIPLIB]	gen-ip016 [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.030	2 / 1.071	3 / 1.077	4 / 1.080	5 / 1.104
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	neos-1456979 [MIPLIB]	arki001 [MIPLIB]	lectsched-3 [MIPLIB]	lectsched-5-obj [MIPLIB]	lectsched-4-obj [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.	114 / 1.552	203 / 1.617	607 / 1.750	638 / 1.760	762 / 1.830
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 supportcase33, the five most similar instances to supportcase33 according to the MIC, and the five most similar instances to supportcase33 according to MIPLIB 2017.

	INSTANCE	SUBMITTER	DESCRIPTION	ISS	RANK
Parent Instance	supportcase33 [MIPLIB]	Domenico Salvagnin	Instance coming from IBM developerWorks forum with unknown application.	0.000000	-
MIC Top 5	scpl4 [MIPLIB]	Shunji Umetani	This is a random test instance 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 instances. We have also generated reduced instances 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 instance generator program from the following web site. https://sites.google.com/site/shunjiumetani/benchmark	1.030125	1
	scpm1 [MIPLIB]	Shunji Umetani	This is a random test instance 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 instances. We have also generated reduced instances 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 instance generator program from the following web site. https://sites.google.com/site/shunjiumetani/benchmark	1.070616	2
	gen-ip021 [MIPLIB]	Simon Bowly	Randomly generated integer and binary programming instances. These results are part of an early phase of work aimed at generating diverse and challenging MIP instances for experimental testing. We have aimed to produce small integer and binary programming instances which are reasonably difficult to solve and have varied structure, eliciting a range of behaviour in state of the art algorithms.	1.076744	3
	gen-ip036 [MIPLIB]	Simon Bowly	Randomly generated integer and binary programming instances. These results are part of an early phase of work aimed at generating diverse and challenging MIP instances for experimental testing. We have aimed to produce small integer and binary programming instances which are reasonably difficult to solve and have varied structure, eliciting a range of behaviour in state of the art algorithms.	1.080012	4
	gen-ip016 [MIPLIB]	Simon Bowly	Randomly generated integer and binary programming instances. These results are part of an early phase of work aimed at generating diverse and challenging MIP instances for experimental testing. We have aimed to produce small integer and binary programming instances which are reasonably difficult to solve and have varied structure, eliciting a range of behaviour in state of the art algorithms. Solved with XPRESS in a few seconds.	1.103670	5
MIPLIB Top 5	neos-1456979 [MIPLIB]	NEOS Server Submission	Imported from the MIPLIB2010 submissions.	1.552230	114
	arki001 [MIPLIB]	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	1.617230	203
	lectsched-3 [MIPLIB]	Harald Schilly	University lecture scheduling instance	1.750342	607
	lectsched-5-obj [MIPLIB]	Harald Schilly	scheduling lectures at university - smaller subset of data with objective to minimize certain overlappings	1.760388	638
	lectsched-4-obj [MIPLIB]	Harald Schilly	University lecture scheduling instance	1.829554	762

These are model group composite (MGC) images for the MIC top 5 model groups.
Name	independentset	neos-pseudoapplication-101	neos-pseudoapplication-21	generated	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.377	2 / 1.420	3 / 1.490	4 / 1.491	5 / 1.572

Model Group Summary

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

	MODEL GROUP	SUBMITTER	DESCRIPTION	ISS	RANK
MIC Top 5	independentset	Toni Sorrell	These models are based on Neil Sloane's Challenge problems: Independent Sets in Graphs.	1.377270	1
	neos-pseudoapplication-101	NEOS Server Submission	Model coming from the NEOS Server with unknown application. Infeasibility claimed by CPLEX 12.6 and CPLEX 12.6.1 with extreme numerical caution emphasi after 4 and 2 hours computation, respectively.	1.419741	2
	neos-pseudoapplication-21	NEOS Server Submission	Imported from the MIPLIB2010 submissions.	1.489657	3
	generated	Simon Bowly	Randomly generated integer and binary programming models. These results are part of an early phase of work aimed at generating diverse and challenging MIP models for experimental testing. We have aimed to produce small integer and binary programming models which are reasonably difficult to solve and have varied structure, eliciting a range of behaviour in state of the art algorithms.	1.491186	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.571999	5

Type:	Instance
Submitter:	Domenico Salvagnin
Description:	Instance coming from IBM developerWorks 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.

supportcase33: Instance-to-Instance Comparison Results

Parent Instance (supportcase33)

MIC Top 5 Instances

MIPLIB Top 5 Instances

Instance Summary

supportcase33: Instance-to-Model Comparison Results

MIC Top 5 Model Groups

Model Group Summary