Instance - neos-3352863-ancoa


	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	eilA101-2 [MIPLIB]	eilC76-2 [MIPLIB]	neos-3634244-kauru [MIPLIB]	2club200v15p5scn [MIPLIB]	neos-1122047 [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.476	2 / 0.674	3 / 0.699	4 / 0.800	5 / 0.810
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	scpj4scip [MIPLIB]	scpk4 [MIPLIB]	scpl4 [MIPLIB]	scpm1 [MIPLIB]	scpn2* [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.	7 / 0.902	8 / 0.912	29 / 1.244	110 / 1.715	110* / 1.715*
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-3352863-ancoa, the five most similar instances to neos-3352863-ancoa according to the MIC, and the five most similar instances to neos-3352863-ancoa according to MIPLIB 2017.

	INSTANCE	SUBMITTER	DESCRIPTION	ISS	RANK
Parent Instance	neos-3352863-ancoa [MIPLIB]	Jeff Linderoth	(None provided)	0.000000	-
MIC Top 5	eilA101-2 [MIPLIB]	J. Linderoth	Set partitioning problem approximation for capicated vehicle routing problem instance from TSPLIB	0.475632	1
	eilC76-2 [MIPLIB]	J. Linderoth	Set partitioning problem approximation for capicated vehicle routing problem instance from TSPLIB Imported from the MIPLIB2010 submissions.	0.673793	2
	neos-3634244-kauru [MIPLIB]	Jeff Linderoth	(None provided)	0.699202	3
	2club200v15p5scn [MIPLIB]	Balabhaskar Balasundaram	Maximum 2-club instance; graph; clique relaxations Solved with Gurobi 8.1 on 24 cores in approx. 23 hours.	0.799993	4
	neos-1122047 [MIPLIB]	NEOS Server Submission	Imported from the MIPLIB2010 submissions.	0.809775	5
MIPLIB Top 5	scpj4scip [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	0.901505	7
	scpk4 [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	0.912311	8
	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.244247	29
	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.715055	110
	scpn2* [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.715055*	110*

These are model group composite (MGC) images for the MIC top 5 model groups.
Name	eil	neos-pseudoapplication-100	neos-pseudoapplication-46	core	neos-pseudoapplication-110
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.530	2 / 0.672	3 / 0.944	4 / 1.020	5 / 1.142

Model Group Summary

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

	MODEL GROUP	SUBMITTER	DESCRIPTION	ISS	RANK
MIC Top 5	eil	J. Linderoth	Set partitioning problem approximation for capicated vehicle routing problem model from TSPLIB	0.530111	1
	neos-pseudoapplication-100	NEOS Server Submission	Model coming from the NEOS Server with unknown application	0.672417	2
	neos-pseudoapplication-46	NEOS Server Submission	Imported from the MIPLIB2010 submissions.	0.944057	3
	core	A. Caprara, M. Fischetti, P. Toth	Set covering model coming from Italian railway models	1.020367	4
	neos-pseudoapplication-110	Jeff Linderoth	(None provided)	1.141840	5

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

neos-3352863-ancoa: Instance-to-Instance Comparison Results

Parent Instance (neos-3352863-ancoa)

MIC Top 5 Instances

MIPLIB Top 5 Instances

Instance Summary

neos-3352863-ancoa: Instance-to-Model Comparison Results

MIC Top 5 Model Groups

Model Group Summary

Model Group Assignment from MIPLIB:	neos-pseudoapplication-100
Assigned Model Group Rank/ISS in the MIC:	2 / 0.672