Instance - siena1


	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	core4284-1064 [MIPLIB]	core2536-691 [MIPLIB]	v150d30-2hopcds [MIPLIB]	sorrell4 [MIPLIB]	scpj4scip [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.058	2 / 1.079	3 / 1.089	4 / 1.097	5 / 1.121
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	dc1c [MIPLIB]	trento1 [MIPLIB]	dolom1 [MIPLIB]	biella1 [MIPLIB]	nsr8k [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.	38 / 1.466	41 / 1.499	42 / 1.551	47 / 1.588	50 / 1.596
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 siena1, the five most similar instances to siena1 according to the MIC, and the five most similar instances to siena1 according to MIPLIB 2017.

	INSTANCE	SUBMITTER	DESCRIPTION	ISS	RANK
Parent Instance	siena1 [MIPLIB]	Double-Click SAS	Crew scheduling instance	0.000000	-
MIC Top 5	core4284-1064 [MIPLIB]	A. Caprara, M. Fischetti, P. Toth	Set covering instance coming from Italian railway models	1.057808	1
	core2536-691 [MIPLIB]	A. Caprara, M. Fischetti, P. Toth	Set covering instance coming from Italian railway models	1.079281	2
	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.	1.089319	3
	sorrell4 [MIPLIB]	Toni Sorrell	These instances are based on Neil Sloane's Challenge problems: Independent Sets in Graphs.	1.096534	4
	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	1.121116	5
MIPLIB Top 5	dc1c [MIPLIB]	Double-Click SAS	Crew scheduling instance. This problem was solved on ISM supercomputer Fujitsu PRIMERGY RX200S5 (http://www.ism.ac.jp/computer_system/eng/sc/index.html) by ParaSCIP in approximately 1100 hours with 14 times restarted 15 jobs.	1.466004	38
	trento1 [MIPLIB]	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	1.499344	41
	dolom1 [MIPLIB]	Double-Click SAS	Crew scheduling instance. Solved with ParaSCIP with SCIP 3.0.1 linked to CPLEX 12.5 as an LP solver on HLRN III with 12288 cores in two runs First run found a feasible solution whose objective function value is 6615265.0000. Giving the feasible solution, the second run solved the instance in 13684.7671 sec.	1.550529	42
	biella1 [MIPLIB]	Double-Click SAS	Crew scheduling instance	1.587656	47
	nsr8k [MIPLIB]	MIPLIB submission pool	Crew scheduling instance	1.596426	50

These are model group composite (MGC) images for the MIC top 5 model groups.
Name	iis	assign1	maxfeassub	air	neos-pseudoapplication-106
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.323	2 / 1.538	3 / 1.600	4 / 1.602	5 / 1.611

Model Group Summary

The table below contains summary information for the five most similar model groups to siena1 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.323499	1
	assign1	Robert Fourer	Imported from the MIPLIB2010 submissions.	1.538458	2
	maxfeassub	Marc Pfetsch	Set covering problems arising from a Benders algorithm for finding maximum feasible subsystems. More details on the generation is given in the README file in the tarball.	1.599677	3
	air	G. Astfalk	Airline crew scheduling set partitioning problem	1.601942	4
	neos-pseudoapplication-106	Hans Mittelmann	Collection of anonymous submissions to the NEOS Server for Optimization	1.610658	5

Type:	Instance
Submitter:	Double-Click SAS
Description:	Crew scheduling instance
	MIPLIB Entry

Model Group Assignment from MIPLIB:	no model group assignment
Assigned Model Group Rank/ISS in the MIC:	N.A. / N.A.

siena1: Instance-to-Instance Comparison Results

Parent Instance (siena1)

MIC Top 5 Instances

MIPLIB Top 5 Instances

Instance Summary

siena1: Instance-to-Model Comparison Results

MIC Top 5 Model Groups

Model Group Summary