Instance - neos-555001


	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	square23 [MIPLIB]	square37 [MIPLIB]	square31 [MIPLIB]	square41 [MIPLIB]	f2gap40400 [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.196	2 / 1.214	3 / 1.220	4 / 1.227	5 / 1.235
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-555343 [MIPLIB]	gus-sch [MIPLIB]	csched007 [MIPLIB]	piperout-d27 [MIPLIB]	neos-933562 [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.	213 / 1.442	267 / 1.467	640 / 1.695	838 / 2.072	879 / 2.198
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 neos-555001, the five most similar instances to neos-555001 according to the MIC, and the five most similar instances to neos-555001 according to MIPLIB 2017.

	INSTANCE	SUBMITTER	DESCRIPTION	ISS	RANK
Parent Instance	neos-555001 [MIPLIB]	NEOS Server Submission	Imported from the MIPLIB2010 submissions.	0.000000	-
MIC Top 5	square23 [MIPLIB]	Sascha Kurz	Squaring the square For a given integer n, determine the minimum number of squares in a tiling of an \\(n\\times n\\) square using using only integer sided squares of smaller size. (Although the models get quite large even for moderate n, they can be solved to optimality for all \\(n \\le 61\\), while challenging the MIP solver, especially the presolver.)	1.195947	1
	square37 [MIPLIB]	Sascha Kurz	Squaring the square For a given integer n, determine the minimum number of squares in a tiling of an \\(n\\times n\\) square using using only integer sided squares of smaller size. (Although the models get quite large even for moderate n, they can be solved to optimality for all \\(n \\le 61\\), while challenging the MIP solver, especially the presolver.)	1.214186	2
	square31 [MIPLIB]	Sascha Kurz	Squaring the square For a given integer n, determine the minimum number of squares in a tiling of an \\(n\\times n\\) square using using only integer sided squares of smaller size. (Although the models get quite large even for moderate n, they can be solved to optimality for all \\(n \\le 61\\), while challenging the MIP solver, especially the presolver.)	1.220230	3
	square41 [MIPLIB]	Sascha Kurz	Squaring the square For a given integer n, determine the minimum number of squares in a tiling of an \\(n\\times n\\) square using using only integer sided squares of smaller size. (Although the models get quite large even for moderate n, they can be solved to optimality for all \\(n \\le 61\\), while challenging the MIP solver, especially the presolver.)	1.226973	4
	f2gap40400 [MIPLIB]	Salim Haddadi	Restrictions of well-known hard generalized assignment problem instances (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600)	1.235076	5
MIPLIB Top 5	neos-555343 [MIPLIB]	NEOS Server Submission	Imported from the MIPLIB2010 submissions.	1.442307	213
	gus-sch [MIPLIB]	Alexandra M. Newman	course scheduling model	1.466983	267
	csched007 [MIPLIB]	Tallys Yunes	Cumulative scheduling problem instance	1.695303	640
	piperout-d27 [MIPLIB]	Gleb Belov	Pipe routing with flexibility constraints. Instances with _GCM in the name are simple routing	2.071970	838
	neos-933562 [MIPLIB]	NEOS Server Submission	Imported from the MIPLIB2010 submissions.	2.198110	879

These are model group composite (MGC) images for the MIC top 5 model groups.
Name	scp	square	supportvectormachine	neos-pseudoapplication-109	neos-pseudoapplication-21
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.655	2 / 1.736	3 / 1.781	4 / 1.791	5 / 1.812

Model Group Summary

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

	MODEL GROUP	SUBMITTER	DESCRIPTION	ISS	RANK
MIC Top 5	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.655224	1
	square	Sascha Kurz	Squaring the square For a given integer n, determine the minimum number of squares in a tiling of an \\(n\\times n\\) square using using only integer sided squares of smaller size. (Although the models get quite large even for moderate n, they can be solved to optimality for all \\(n \\le 61\\), while challenging the MIP solver, especially the presolver.)	1.735912	2
	supportvectormachine	Toni Sorrell	Suport vector machine with ramp loss. GSVM2-RL is the formulation found in Hess E. and Brooks P. (2015) paper, The Support Vector Machine and Mixed Integer Linear Programming: Ramp Loss SVM with L1-Norm Regularization	1.781462	3
	neos-pseudoapplication-109	Jeff Linderoth	(None provided)	1.790913	4
	neos-pseudoapplication-21	NEOS Server Submission	Imported from the MIPLIB2010 submissions.	1.811824	5

Type:	Instance
Submitter:	NEOS Server Submission
Description:	Imported from the MIPLIB2010 submissions.
	MIPLIB Entry

Model Group Assignment from MIPLIB:	neos-pseudoapplication-94
Assigned Model Group Rank/ISS in the MIC:	193 / 3.187

neos-555001: Instance-to-Instance Comparison Results

Parent Instance (neos-555001)

MIC Top 5 Instances

MIPLIB Top 5 Instances

Instance Summary

neos-555001: Instance-to-Model Comparison Results

MIC Top 5 Model Groups

Model Group Summary