Instance - nw04


	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	irp [MIPLIB]	scpl4 [MIPLIB]	neos5 [MIPLIB]	air03 [MIPLIB]	supportcase33 [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.094	2 / 1.178	3 / 1.187	4 / 1.195	5 / 1.199
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	eilA101-2 [MIPLIB]	eilC76-2 [MIPLIB]	ivu06 [MIPLIB]	ds-big [MIPLIB]	eilA101-2** [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.	53 / 1.556	69 / 1.614	987 / 3.169	988 / 3.210	N.A. / N.A.
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 nw04, the five most similar instances to nw04 according to the MIC, and the five most similar instances to nw04 according to MIPLIB 2017.

	INSTANCE	SUBMITTER	DESCRIPTION	ISS	RANK
Parent Instance	nw04 [MIPLIB]	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	0.000000	-
MIC Top 5	irp [MIPLIB]	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	1.094144	1
	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.178064	2
	neos5 [MIPLIB]	NEOS Server Submission	Imported from the MIPLIB2010 submissions.	1.186565	3
	air03 [MIPLIB]	G. Astfalk	Airline crew scheduling set partitioning problem	1.195034	4
	supportcase33 [MIPLIB]	Domenico Salvagnin	Instance coming from IBM developerWorks forum with unknown application.	1.199310	5
MIPLIB Top 5	eilA101-2 [MIPLIB]	J. Linderoth	Set partitioning problem approximation for capicated vehicle routing problem instance from TSPLIB	1.556347	53
	eilC76-2 [MIPLIB]	J. Linderoth	Set partitioning problem approximation for capicated vehicle routing problem instance from TSPLIB Imported from the MIPLIB2010 submissions.	1.613786	69
	ivu06 [MIPLIB]	S. Weider	Set partitioning instance resulting from a column generation algorithm used for duty scheduling in public transportation. Solved in June 2014 using CPLEX 12.6 with 48 threads in about 25 days.	3.169351	987
	ds-big [MIPLIB]	Steffen Weider	Bus driver duty scheduling problem	3.210094	988
	eilA101-2** [MIPLIB]	S. Weider	Set partitioning instance resulting from a column generation algorithm used for duty scheduling in public transportation	N.A.**	N.A.**

These are model group composite (MGC) images for the MIC top 5 model groups.
Name	neos-pseudoapplication-21	scp	generated	independentset	markshare
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.358	2 / 1.408	3 / 1.485	4 / 1.507	5 / 1.607

Model Group Summary

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

	MODEL GROUP	SUBMITTER	DESCRIPTION	ISS	RANK
MIC Top 5	neos-pseudoapplication-21	NEOS Server Submission	Imported from the MIPLIB2010 submissions.	1.358313	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	1.408038	2
	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.485398	3
	independentset	Toni Sorrell	These models are based on Neil Sloane's Challenge problems: Independent Sets in Graphs.	1.507358	4
	markshare	G. Cornuéjols, M. Dawande	Market sharing problem	1.606532	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.

nw04: Instance-to-Instance Comparison Results

Parent Instance (nw04)

MIC Top 5 Instances

MIPLIB Top 5 Instances

Instance Summary

nw04: Instance-to-Model Comparison Results

MIC Top 5 Model Groups

Model Group Summary