Instance - sp98ir


	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	gen-ip021 [MIPLIB]	ns1952667 [MIPLIB]	gen-ip016 [MIPLIB]	neos5 [MIPLIB]	gen-ip036 [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.662	2 / 1.673	3 / 1.680	4 / 1.683	5 / 1.689
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	neos859080 [MIPLIB]	comp12-2idx [MIPLIB]	comp21-2idx [MIPLIB]	neos859080** [MIPLIB]	neos859080** [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.	180 / 2.030	649 / 2.206	774 / 2.283	N.A. / N.A.	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 sp98ir, the five most similar instances to sp98ir according to the MIC, and the five most similar instances to sp98ir according to MIPLIB 2017.

	INSTANCE	SUBMITTER	DESCRIPTION	ISS	RANK
Parent Instance	sp98ir [MIPLIB]	J. Goessens, S. v. Hoessel, L. Kroon	Railway line planning instance	0.000000	-
MIC Top 5	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.662159	1
	ns1952667 [MIPLIB]	NEOS Server Submission	Instance coming from the NEOS Server with unknown application	1.673197	2
	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.680294	3
	neos5 [MIPLIB]	NEOS Server Submission	Imported from the MIPLIB2010 submissions.	1.683458	4
	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.689310	5
MIPLIB Top 5	neos859080 [MIPLIB]	NEOS Server Submission	Imported from the MIPLIB2010 submissions.	2.029683	180
	comp12-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.205727	649
	comp21-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.282519	774
	neos859080** [MIPLIB]	A. Bley	Min-cost network dimensioning problem with finite sets of link capacities and unsplittable flow routing	N.A.**	N.A.**
	neos859080** [MIPLIB]	A. Bley	Min-cost network dimensioning problem with finite sets of link capacities and unsplittable flow routing	N.A.**	N.A.**

These are model group composite (MGC) images for the MIC top 5 model groups.
Name	independentset	scp	neos-pseudoapplication-21	neos-pseudoapplication-64	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 / 2.348	2 / 2.459	3 / 2.463	4 / 2.509	5 / 2.521

Model Group Summary

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

	MODEL GROUP	SUBMITTER	DESCRIPTION	ISS	RANK
MIC Top 5	independentset	Toni Sorrell	These models are based on Neil Sloane's Challenge problems: Independent Sets in Graphs.	2.348236	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.459333	2
	neos-pseudoapplication-21	NEOS Server Submission	Imported from the MIPLIB2010 submissions.	2.463247	3
	neos-pseudoapplication-64	Hans Mittelmann	Collection of anonymous submissions to the NEOS Server for Optimization	2.509397	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.	2.521435	5

Type:	Instance
Submitter:	J. Goessens, S. v. Hoessel, L. Kroon
Description:	Railway line planning instance
	MIPLIB Entry

Model Group Assignment from MIPLIB:	sp9
Assigned Model Group Rank/ISS in the MIC:	109 / 3.071

sp98ir: Instance-to-Instance Comparison Results

Parent Instance (sp98ir)

MIC Top 5 Instances

MIPLIB Top 5 Instances

Instance Summary

sp98ir: Instance-to-Model Comparison Results

MIC Top 5 Model Groups

Model Group Summary