Instance - fast0507


	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	rail507 [MIPLIB]	v150d30-2hopcds [MIPLIB]	core2536-691 [MIPLIB]	air04 [MIPLIB]	air05 [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.629	2 / 0.911	3 / 0.918	4 / 0.963	5 / 0.972
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	v150d30-2hopcds [MIPLIB]	scpk4 [MIPLIB]	ramos3 [MIPLIB]	ex1010-pi [MIPLIB]	seymour [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.	2 / 0.911	9 / 1.026	119 / 2.112	129 / 2.204	135 / 2.234
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 fast0507, the five most similar instances to fast0507 according to the MIC, and the five most similar instances to fast0507 according to MIPLIB 2017.

	INSTANCE	SUBMITTER	DESCRIPTION	ISS	RANK
Parent Instance	fast0507 [MIPLIB]	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	0.000000	-
MIC Top 5	rail507 [MIPLIB]	A. Caprara, M. Fischetti, P. Toth	Railway crew scheduling	0.629065	1
	v150d30-2hopcds [MIPLIB]	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, instances with as few as 120 variables are left unsolved after one hour using Gurobi 7.0.2.	0.910584	2
	core2536-691 [MIPLIB]	A. Caprara, M. Fischetti, P. Toth	Set covering instance coming from Italian railway models	0.918381	3
	air04 [MIPLIB]	G. Astfalk	Airline crew scheduling set partitioning problem	0.962692	4
	air05 [MIPLIB]	G. Astfalk	Airline crew scheduling set partitioning problem	0.972239	5
MIPLIB Top 5	v150d30-2hopcds [MIPLIB]	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, instances with as few as 120 variables are left unsolved after one hour using Gurobi 7.0.2.	0.910584	2
	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	1.025706	9
	ramos3 [MIPLIB]	F. Ramos	Set covering problem from a product manufacturing application	2.112176	119
	ex1010-pi [MIPLIB]	M. Winkler	Logic synthesis problem from the 2010 SAT conference pseudo-Boolean competition	2.204476	129
	seymour [MIPLIB]	W. Cook, P. Seymour	A set-covering problem that arose from work related to the proof of the 4-color theorem.	2.233892	135

These are model group composite (MGC) images for the MIC top 5 model groups.
Name	iis	neos-pseudoapplication-106	air	2hopcds	neos-pseudoapplication-23
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.102	2 / 1.137	3 / 1.284	4 / 1.323	5 / 1.345

Model Group Summary

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

	MODEL GROUP	SUBMITTER	DESCRIPTION	ISS	RANK
MIC Top 5	iis	Marc Pfetsch	23 "middlehard" Set-Covering Models 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 models can be created.	1.101805	1
	neos-pseudoapplication-106	Hans Mittelmann	Collection of anonymous submissions to the NEOS Server for Optimization	1.136606	2
	air	G. Astfalk	Airline crew scheduling set partitioning problem	1.283945	3
	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.	1.322585	4
	neos-pseudoapplication-23	NEOS Server Submission	Imported from the MIPLIB2010 submissions.	1.344561	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.

fast0507: Instance-to-Instance Comparison Results

Parent Instance (fast0507)

MIC Top 5 Instances

MIPLIB Top 5 Instances

Instance Summary

fast0507: Instance-to-Model Comparison Results

MIC Top 5 Model Groups

Model Group Summary