Instance - ns1904248


	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	scpm1 [MIPLIB]	gen-ip002 [MIPLIB]	gen-ip021 [MIPLIB]	gen-ip036 [MIPLIB]	gen-ip016 [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.177	2 / 1.185	3 / 1.186	4 / 1.207	5 / 1.215
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-4260495-otere [MIPLIB]	neos-4306827-ravan [MIPLIB]	ns1828997 [MIPLIB]	neos-4724674-aorere [MIPLIB]	neos-4295773-pissa [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.	58 / 1.528	68 / 1.539	95 / 1.569	97 / 1.577	724 / 1.810
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 ns1904248, the five most similar instances to ns1904248 according to the MIC, and the five most similar instances to ns1904248 according to MIPLIB 2017.

	INSTANCE	SUBMITTER	DESCRIPTION	ISS	RANK
Parent Instance	ns1904248 [MIPLIB]	NEOS Server Submission	Sensor placement problem	0.000000	-
MIC Top 5	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.176616	1
	gen-ip002 [MIPLIB]	Simon Bowly	Randomly generated integer and binary programming instances. These results are part of an early phase of work aimed at generating diverse and challenging MIP instances for experimental testing. We have aimed to produce small integer and binary programming instances which are reasonably difficult to solve and have varied structure, eliciting a range of behaviour in state of the art algorithms.	1.185282	2
	gen-ip021 [MIPLIB]	Simon Bowly	Randomly generated integer and binary programming instances. These results are part of an early phase of work aimed at generating diverse and challenging MIP instances for experimental testing. We have aimed to produce small integer and binary programming instances which are reasonably difficult to solve and have varied structure, eliciting a range of behaviour in state of the art algorithms.	1.186336	3
	gen-ip036 [MIPLIB]	Simon Bowly	Randomly generated integer and binary programming instances. These results are part of an early phase of work aimed at generating diverse and challenging MIP instances for experimental testing. We have aimed to produce small integer and binary programming instances which are reasonably difficult to solve and have varied structure, eliciting a range of behaviour in state of the art algorithms.	1.207101	4
	gen-ip016 [MIPLIB]	Simon Bowly	Randomly generated integer and binary programming instances. These results are part of an early phase of work aimed at generating diverse and challenging MIP instances for experimental testing. We have aimed to produce small integer and binary programming instances which are reasonably difficult to solve and have varied structure, eliciting a range of behaviour in state of the art algorithms. Solved with XPRESS in a few seconds.	1.215408	5
MIPLIB Top 5	neos-4260495-otere [MIPLIB]	Jeff Linderoth	(None provided)	1.528333	58
	neos-4306827-ravan [MIPLIB]	Jeff Linderoth	(None provided)	1.538903	68
	ns1828997 [MIPLIB]	NEOS Server Submission	Instance coming from the NEOS Server with unknown application.	1.569174	95
	neos-4724674-aorere [MIPLIB]	Jeff Linderoth	(None provided)	1.576772	97
	neos-4295773-pissa [MIPLIB]	Jeff Linderoth	(None provided)	1.809937	724

These are model group composite (MGC) images for the MIC top 5 model groups.
Name	scp	neos-pseudoapplication-21	stein	independentset	generated
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.511	2 / 1.601	3 / 1.703	4 / 1.756	5 / 1.769

Model Group Summary

The table below contains summary information for the five most similar model groups to ns1904248 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.511271	1
	neos-pseudoapplication-21	NEOS Server Submission	Imported from the MIPLIB2010 submissions.	1.600529	2
	stein	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	1.702842	3
	independentset	Toni Sorrell	These models are based on Neil Sloane's Challenge problems: Independent Sets in Graphs.	1.755502	4
	generated	Simon Bowly	Randomly generated integer and binary programming models. These results are part of an early phase of work aimed at generating diverse and challenging MIP models for experimental testing. We have aimed to produce small integer and binary programming models which are reasonably difficult to solve and have varied structure, eliciting a range of behaviour in state of the art algorithms.	1.769202	5

Type:	Instance
Submitter:	NEOS Server Submission
Description:	Sensor placement problem
	MIPLIB Entry

Model Group Assignment from MIPLIB:	neos-pseudoapplication-6
Assigned Model Group Rank/ISS in the MIC:	96 / 2.370

ns1904248: Instance-to-Instance Comparison Results

Parent Instance (ns1904248)

MIC Top 5 Instances

MIPLIB Top 5 Instances

Instance Summary

ns1904248: Instance-to-Model Comparison Results

MIC Top 5 Model Groups

Model Group Summary