Instance - neos5


	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	f2gap801600 [MIPLIB]	gen-ip036 [MIPLIB]	scpl4 [MIPLIB]	f2gap401600 [MIPLIB]	ns1952667 [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.583	2 / 0.597	3 / 0.629	4 / 0.674	5 / 0.710
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	ramos3 [MIPLIB]	mod008inf [MIPLIB]	seymour1 [MIPLIB]	hanoi5 [MIPLIB]	probportfolio [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.	85 / 1.361	185 / 1.524	309 / 1.619	400 / 1.667	747 / 1.823
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 neos5, the five most similar instances to neos5 according to the MIC, and the five most similar instances to neos5 according to MIPLIB 2017.

	INSTANCE	SUBMITTER	DESCRIPTION	ISS	RANK
Parent Instance	neos5 [MIPLIB]	NEOS Server Submission	Imported from the MIPLIB2010 submissions.	0.000000	-
MIC Top 5	f2gap801600 [MIPLIB]	Salim Haddadi	Restrictions of well-known hard generalized assignment problem instances (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600)	0.582941	1
	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.	0.597265	2
	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	0.628829	3
	f2gap401600 [MIPLIB]	Salim Haddadi	Restrictions of well-known hard generalized assignment problem instances (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600)	0.673632	4
	ns1952667 [MIPLIB]	NEOS Server Submission	Instance coming from the NEOS Server with unknown application	0.709619	5
MIPLIB Top 5	ramos3 [MIPLIB]	F. Ramos	Set covering problem from a product manufacturing application	1.360961	85
	mod008inf [MIPLIB]	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	1.524318	185
	seymour1 [MIPLIB]	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	1.619041	309
	hanoi5 [MIPLIB]	M. Winkler	Reformulated SAT instance from the 2010 SAT conference pseudo-Boolean competition. Solved due to the 2012 pseudo-Boolean competition.	1.667480	400
	probportfolio [MIPLIB]	Feng Qiu	Sample average approximation formulation of a probabilistic portfolio optimization problem. Solved using ug[SCIP/spx], a distributed massively parallel version of SCIP run on 2,000 cores at the HLRN-II super computer facility.	1.822834	747

These are model group composite (MGC) images for the MIC top 5 model groups.
Name	neos-pseudoapplication-21	generated	scp	independentset	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 / 0.001	2 / 0.765	3 / 0.770	4 / 0.967	5 / 0.983

Model Group Summary

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

	MODEL GROUP	SUBMITTER	DESCRIPTION	ISS	RANK
MIC Top 5	neos-pseudoapplication-21	NEOS Server Submission	Imported from the MIPLIB2010 submissions.	0.000977	1
	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.	0.764970	2
	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	0.769601	3
	independentset	Toni Sorrell	These models are based on Neil Sloane's Challenge problems: Independent Sets in Graphs.	0.967178	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.	0.983249	5

Type:	Instance
Submitter:	NEOS Server Submission
Description:	Imported from the MIPLIB2010 submissions.
	MIPLIB Entry

Model Group Assignment from MIPLIB:	neos-pseudoapplication-21
Assigned Model Group Rank/ISS in the MIC:	1 / 0.000

neos5: Instance-to-Instance Comparison Results

Parent Instance (neos5)

MIC Top 5 Instances

MIPLIB Top 5 Instances

Instance Summary

neos5: Instance-to-Model Comparison Results

MIC Top 5 Model Groups

Model Group Summary