Instance - cod105


	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	glass-sc [MIPLIB]	supportcase19 [MIPLIB]	assign1-10-4 [MIPLIB]	iis-glass-cov [MIPLIB]	neos-4382714-ruvuma [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.607	2 / 1.644	3 / 1.648	4 / 1.652	5 / 1.668
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	cdc7-4-3-2 [MIPLIB]	a2864-99blp [MIPLIB]	sorrell7 [MIPLIB]	sorrell8 [MIPLIB]	sorrell3 [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.	46 / 1.864	79 / 2.014	215 / 2.367	268 / 2.456	449 / 2.650
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 cod105, the five most similar instances to cod105 according to the MIC, and the five most similar instances to cod105 according to MIPLIB 2017.

	INSTANCE	SUBMITTER	DESCRIPTION	ISS	RANK
Parent Instance	cod105 [MIPLIB]	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	0.000000	-
MIC Top 5	glass-sc [MIPLIB]	Marc Pfetsch	Set covering problems arising from a Benders algorithm for finding maximum feasible subsystems. More details on the generation is given in the README file in the tarball.	1.607378	1
	supportcase19 [MIPLIB]	Michael Winkler	MIP instances collected from Gurobi forum with unknown application	1.643614	2
	assign1-10-4 [MIPLIB]	Robert Fourer	Imported from the MIPLIB2010 submissions.	1.647703	3
	iis-glass-cov [MIPLIB]	Marc Pfetsch	23 "middlehard" Set-Covering Instances for MIPLIB: they have a small number of variables compared to the number of constraints and CPLEX 12.1 needs about one hour to solve them.For more information, have a look into the readme file which explains how the instances can be created.	1.651817	4
	neos-4382714-ruvuma [MIPLIB]	Hans Mittelmann	Collection of anonymous submissions to the NEOS Server for Optimization	1.667534	5
MIPLIB Top 5	cdc7-4-3-2 [MIPLIB]	Sascha Kurz	Codes for Networkcoding A constant dimension code with parameters n, k, d and q is a collection of k-dimensional subspaces of the n-dimensional vector space \\(GF(q)^n\\) over a finite field with q elements, called codewords, such that the dimension of the intersection of each pair of different k-dimensional subspaces is at most \\(k-d/2\\). Let \\(A_q(n,d;k)\\) denote the maximum number of codewords. For instance cdc6-4-3-2 \\(A_2(6,4;3)=77\\) is known , while \\(333 \\le A_2(7,4;3) \\le 381\\) for instance cdc7-4-3-2 are the tightest known bounds, see e.g. . A code of size 381 would correspond to a putative binary q-analog of the Fano plane (finite projective plane of order 2 with 7 points and lines). More bounds are available at http://subspacecodes.uni-bayreuth.de.	1.864078	46
	a2864-99blp [MIPLIB]	Daniel Heinlein	Clique problems arising from a selection problem of subspaces in the PG(7,2) with different prescribed variables and numerically instable linear programming relaxation.	2.013539	79
	sorrell7 [MIPLIB]	Toni Sorrell	These instances are based on Neil Sloane's Challenge problems: Independent Sets in Graphs.	2.367380	215
	sorrell8 [MIPLIB]	Toni Sorrell	These instances are based on Neil Sloane's Challenge problems: Independent Sets in Graphs.	2.456092	268
	sorrell3 [MIPLIB]	Toni Sorrell	These instances are based on Neil Sloane's Challenge problems: Independent Sets in Graphs.	2.650153	449

These are model group composite (MGC) images for the MIC top 5 model groups.
Name	f2gap	network_design	neos-pseudoapplication-103	maxfeassub	2hopcds
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 / 2.185	2 / 2.190	3 / 2.213	4 / 2.222	5 / 2.294

Model Group Summary

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

	MODEL GROUP	SUBMITTER	DESCRIPTION	ISS	RANK
MIC Top 5	f2gap	Salim Haddadi	Restrictions of well-known hard generalized assignment problem models (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600)	2.184659	1
	network_design	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	2.189720	2
	neos-pseudoapplication-103	Hans Mittelmann	Collection of anonymous submissions to the NEOS Server for Optimization	2.213484	3
	maxfeassub	Marc Pfetsch	Set covering problems arising from a Benders algorithm for finding maximum feasible subsystems. More details on the generation is given in the README file in the tarball.	2.221657	4
	2hopcds	Austin Buchanan	A problem in wireless networks. The objective is to select a minimum number of relay nodes so that any two nonadjacent nodes can communicate by way of the chosen relay nodes in at most s hops, where s is a problem input. The 2-hop case of this problem can be formulated as a set cover/hitting set problem with n binary variables and n^2 constraints: _{ k N(i) N(j) } x_k 1 for nonadjacent node pairs {i,j}. Despite the formulation's simplicity, models with as few as 120 variables are left unsolved after one hour using Gurobi 7.0.2.	2.294050	5

Type:	Instance
Submitter:	MIPLIB submission pool
Description:	Imported from the MIPLIB2010 submissions.
	MIPLIB Entry

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

cod105: Instance-to-Instance Comparison Results

Parent Instance (cod105)

MIC Top 5 Instances

MIPLIB Top 5 Instances

Instance Summary

cod105: Instance-to-Model Comparison Results

MIC Top 5 Model Groups

Model Group Summary