Instance - 30_70_45_05


	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	30_70_45_095_98 [MIPLIB]	neos18 [MIPLIB]	gen-ip021 [MIPLIB]	neos-960392 [MIPLIB]	scpl4 [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.674	2 / 1.588	3 / 1.644	4 / 1.660	5 / 1.672
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	30_70_45_095_98 [MIPLIB]	supportcase40 [MIPLIB]	comp08-2idx [MIPLIB]	30_70_45_095_100 [MIPLIB]	comp07-2idx [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.	1 / 0.674	229 / 2.146	796 / 2.411	872 / 2.505	894 / 2.556
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 30_70_45_05_100, the five most similar instances to 30_70_45_05_100 according to the MIC, and the five most similar instances to 30_70_45_05_100 according to MIPLIB 2017.

	INSTANCE	SUBMITTER	DESCRIPTION	ISS	RANK
Parent Instance	30_70_45_05_100 [MIPLIB]	J. Walser	Geographic radar station allocation	0.000000	-
MIC Top 5	30_70_45_095_98 [MIPLIB]	J. Walser	Geographic radar station allocation	0.674439	1
	neos18 [MIPLIB]	NEOS Server Submission	Instance coming from the NEOS Server with unknown application	1.588190	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.643848	3
	neos-960392 [MIPLIB]	NEOS Server Submission	Imported from the MIPLIB2010 submissions.	1.660125	4
	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.671736	5
MIPLIB Top 5	30_70_45_095_98 [MIPLIB]	J. Walser	Geographic radar station allocation	0.674439	1
	supportcase40 [MIPLIB]	Domenico Salvagnin	Instance coming from IBM developerWorks forum with unknown application.	2.146299	229
	comp08-2idx [MIPLIB]	Matias Sørensen	Instances comp01-21 of curriculum based course timetabling from the International Timetabling Competition 2007. These are time-assignment models (Stage I of the decomposed model), which are smaller than the full model, but still hard to solve.	2.410974	796
	30_70_45_095_100 [MIPLIB]	J. Walser	Geographic radar station allocation	2.504707	872
	comp07-2idx [MIPLIB]	Matias Sørensen	Instances comp01-21 of curriculum based course timetabling from the International Timetabling Competition 2007. These are time-assignment models (Stage I of the decomposed model), which are smaller than the full model, but still hard to solve.	2.556234	894

These are model group composite (MGC) images for the MIC top 5 model groups.
Name	neos-pseudoapplication-21	scp	independentset	markshare	neos-pseudoapplication-101
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.138	2 / 2.170	3 / 2.213	4 / 2.244	5 / 2.249

Model Group Summary

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

	MODEL GROUP	SUBMITTER	DESCRIPTION	ISS	RANK
MIC Top 5	neos-pseudoapplication-21	NEOS Server Submission	Imported from the MIPLIB2010 submissions.	2.137673	1
	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	2.169891	2
	independentset	Toni Sorrell	These models are based on Neil Sloane's Challenge problems: Independent Sets in Graphs.	2.212619	3
	markshare	G. Cornuéjols, M. Dawande	Market sharing problem	2.244455	4
	neos-pseudoapplication-101	NEOS Server Submission	Model coming from the NEOS Server with unknown application. Infeasibility claimed by CPLEX 12.6 and CPLEX 12.6.1 with extreme numerical caution emphasi after 4 and 2 hours computation, respectively.	2.249447	5

Type:	Instance
Submitter:	J. Walser
Description:	Geographic radar station allocation
	MIPLIB Entry

Model Group Assignment from MIPLIB:	30_70
Assigned Model Group Rank/ISS in the MIC:	7 / 2.276

30_70_45_05_100: Instance-to-Instance Comparison Results

Parent Instance (30_70_45_05_100)

MIC Top 5 Instances

MIPLIB Top 5 Instances

Instance Summary

30_70_45_05_100: Instance-to-Model Comparison Results

MIC Top 5 Model Groups

Model Group Summary