Instance - neos-4703857-ahuroa


	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	graph40-40-1rand [MIPLIB]	graph40-80-1rand [MIPLIB]	polygonpack5-15 [MIPLIB]	rmatr200-p20 [MIPLIB]	polygonpack4-15 [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.260	2 / 0.284	3 / 0.304	4 / 0.354	5 / 0.367
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	sing44 [MIPLIB]	sing326 [MIPLIB]	unitcal_7 [MIPLIB]	uccase8 [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.	28 / 0.623	70 / 0.721	139 / 0.891	480 / 1.457	935 / 2.996
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-4703857-ahuroa, the five most similar instances to neos-4703857-ahuroa according to the MIC, and the five most similar instances to neos-4703857-ahuroa according to MIPLIB 2017.

	INSTANCE	SUBMITTER	DESCRIPTION	ISS	RANK
Parent Instance	neos-4703857-ahuroa [MIPLIB]	Jeff Linderoth	(None provided)	0.000000	-
MIC Top 5	graph40-40-1rand [MIPLIB]	Michael Bastubbe	Packing Cuts in Undirected Graphs. Instances are described in 4.1.	0.259888	1
	graph40-80-1rand [MIPLIB]	Michael Bastubbe	Packing Cuts in Undirected Graphs. Instances are described in 4.1.	0.283771	2
	polygonpack5-15 [MIPLIB]	Antonio Frangioni	Given a set P of polygons, not necessarily convex, and a rectangle, we want to find the subset S of P with largest possible total area and a position every p in S so that there are no overlaps and they are all included in the rectangle. We allow a small set of rotations (0, 90, 180, 270 degrees) for every polygon. The problem is simplified w.r.t. the real application because the polygons do not have (fully encircled) "holes", which are supposedly filled-in separately, although they can have "bays". Models are saved as .lp. Instance LpPackingModel_Dim means that we are trying to pack polygons taken from set ; there are currently 5 different sets, and is 7, 10 or 15.	0.304198	3
	rmatr200-p20 [MIPLIB]	Dmitry Krushinsky	Instance coming from a formulation of the p-Median problem using square cost matrices. Solved using ug[SCIP/spx], a distributed massively parallel version of SCIP run on 2,000 cores at the HLRN-II super computer facility.	0.353800	4
	polygonpack4-15 [MIPLIB]	Antonio Frangioni	Given a set P of polygons, not necessarily convex, and a rectangle, we want to find the subset S of P with largest possible total area and a position every p in S so that there are no overlaps and they are all included in the rectangle. We allow a small set of rotations (0, 90, 180, 270 degrees) for every polygon. The problem is simplified w.r.t. the real application because the polygons do not have (fully encircled) "holes", which are supposedly filled-in separately, although they can have "bays". Models are saved as .lp. Instance LpPackingModel_Dim means that we are trying to pack polygons taken from set ; there are currently 5 different sets, and is 7, 10 or 15.	0.366758	5
MIPLIB Top 5	sing44 [MIPLIB]	Daniel Espinoza	Imported from the MIPLIB2010 submissions.	0.622930	28
	sing326 [MIPLIB]	Daniel Espinoza	Imported from the MIPLIB2010 submissions.	0.720754	70
	unitcal_7 [MIPLIB]	R. O’Neill	California seven day unit commitment problem	0.891001	139
	uccase8 [MIPLIB]	Daniel Espinoza	Imported from the MIPLIB2010 submissions.	1.457224	480
	gasprod2-2 [MIPLIB]	Andrew Stamps	Production planning model of a second industrial gas system. Two model instances included.	2.995705	935

These are model group composite (MGC) images for the MIC top 5 model groups.
Name	rmatr	map	polygonpack	n37	graphs
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.446	2 / 0.478	3 / 0.544	4 / 0.886	5 / 0.922

Model Group Summary

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

	MODEL GROUP	SUBMITTER	DESCRIPTION	ISS	RANK
MIC Top 5	rmatr	Dmitry Krushinsky	Model coming from a formulation of the p-Median problem using square cost matrices	0.445977	1
	map	Kiyan Ahmadizadeh	Land parcel selection problems motivated by Red-Cockaded Woodpecker conservation problem	0.477583	2
	polygonpack	Antonio Frangioni	Given a set P of polygons, not necessarily convex, and a rectangle, we want to find the subset S of P with largest possible total area and a position every p in S so that there are no overlaps and they are all included in the rectangle. We allow a small set of rotations (0, 90, 180, 270 degrees) for every polygon. The problem is simplified w.r.t. the real application because the polygons do not have (fully encircled) "holes", which are supposedly filled-in separately, although they can have "bays". Models are saved as .lp. Model LpPackingModel_Dim means that we are trying to pack polygons taken from set ; there are currently 5 different sets, and is 7, 10 or 15.	0.544357	3
	n37	J. Aronson	Fixed charge transportation problem	0.886103	4
	graphs	Michael Bastubbe	Packing Cuts in Undirected Graphs. Models are described in 4.1.	0.922478	5

Type:	Instance
Submitter:	Jeff Linderoth
Description:	(None provided)
	MIPLIB Entry

Model Group Assignment from MIPLIB:	neos-pseudoapplication-82
Assigned Model Group Rank/ISS in the MIC:	192 / 3.672

neos-4703857-ahuroa: Instance-to-Instance Comparison Results

Parent Instance (neos-4703857-ahuroa)

MIC Top 5 Instances

MIPLIB Top 5 Instances

Instance Summary

neos-4703857-ahuroa: Instance-to-Model Comparison Results

MIC Top 5 Model Groups

Model Group Summary