Instance - neos-3615091-sutlej


	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	square37 [MIPLIB]	square31 [MIPLIB]	square47 [MIPLIB]	square41 [MIPLIB]	square23 [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 / 0.786	2 / 0.806	3 / 0.833	4 / 0.836	5 / 0.837
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	ns1631475 [MIPLIB]	neos-2974461-ibar [MIPLIB]	unitcal_7 [MIPLIB]	neos-5041822-cockle [MIPLIB]	gasprod2-2 [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.	304 / 1.344	347 / 1.385	400 / 1.428	641 / 1.703	936 / 2.859
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-3615091-sutlej, the five most similar instances to neos-3615091-sutlej according to the MIC, and the five most similar instances to neos-3615091-sutlej according to MIPLIB 2017.

	INSTANCE	SUBMITTER	DESCRIPTION	ISS	RANK
Parent Instance	neos-3615091-sutlej [MIPLIB]	Hans Mittelmann	Collection of anonymous submissions to the NEOS Server for Optimization	0.000000	-
MIC Top 5	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.)	0.785826	1
	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.)	0.806173	2
	square47 [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.)	0.832547	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.)	0.835559	4
	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.)	0.836533	5
MIPLIB Top 5	ns1631475 [MIPLIB]	NEOS Server Submission	Traveling salesman problem model	1.343877	304
	neos-2974461-ibar [MIPLIB]	Jeff Linderoth	(None provided)	1.384719	347
	unitcal_7 [MIPLIB]	R. O’Neill	California seven day unit commitment problem	1.427882	400
	neos-5041822-cockle [MIPLIB]	Jeff Linderoth	(None provided)	1.703194	641
	gasprod2-2 [MIPLIB]	Andrew Stamps	Production planning model of a second industrial gas system. Two model instances included.	2.858601	936

These are model group composite (MGC) images for the MIC top 5 model groups.
Name	supportvectormachine	square	hypothyroid	scp	neos-pseudoapplication-109
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.357	2 / 1.370	3 / 1.718	4 / 1.819	5 / 1.835

Model Group Summary

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

	MODEL GROUP	SUBMITTER	DESCRIPTION	ISS	RANK
MIC Top 5	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.356946	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.369555	2
	hypothyroid	Gleb Belov	Linearized Constraint Programming models of the MiniZinc Challenges 2012-2016. I should be able to produce versions with indicator constraints supported by Gurobi and CPLEX, however don't know if you can use them and if there is a standard format. These MPS were produced by Gurobi 7.0.2 using the MiniZinc develop branch on eb536656062ca13325a96b5d0881742c7d0e3c38	1.717811	3
	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.818737	4
	neos-pseudoapplication-109	Jeff Linderoth	(None provided)	1.835084	5

Type:	Instance
Submitter:	Hans Mittelmann
Description:	Collection of anonymous submissions to the NEOS Server for Optimization
	MIPLIB Entry

Model Group Assignment from MIPLIB:	neos-pseudoapplication-45
Assigned Model Group Rank/ISS in the MIC:	86 / 2.463

neos-3615091-sutlej: Instance-to-Instance Comparison Results

Parent Instance (neos-3615091-sutlej)

MIC Top 5 Instances

MIPLIB Top 5 Instances

Instance Summary

neos-3615091-sutlej: Instance-to-Model Comparison Results

MIC Top 5 Model Groups

Model Group Summary