Instance - assign1-5-8


	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-ip002 [MIPLIB]	gen-ip054 [MIPLIB]	gen-ip016 [MIPLIB]	gen-ip021 [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 / 0.642	2 / 0.665	3 / 0.677	4 / 0.686	5 / 0.695
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	neos-911970 [MIPLIB]	rlp1 [MIPLIB]	assign1-10-4 [MIPLIB]	bppc8-09 [MIPLIB]	bppc4-08 [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.	71 / 1.261	191 / 1.367	775 / 1.619	853 / 1.805	947 / 2.139
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 assign1-5-8, the five most similar instances to assign1-5-8 according to the MIC, and the five most similar instances to assign1-5-8 according to MIPLIB 2017.

	INSTANCE	SUBMITTER	DESCRIPTION	ISS	RANK
Parent Instance	assign1-5-8 [MIPLIB]	Robert Fourer	Imported from the MIPLIB2010 submissions.	0.000000	-
MIC Top 5	gen-ip002 [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.642021	1
	gen-ip054 [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.665412	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.	0.677093	3
	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.	0.685527	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.	0.694836	5
MIPLIB Top 5	neos-911970 [MIPLIB]	NEOS Server Submission	Imported from the MIPLIB2010 submissions.	1.261451	71
	rlp1 [MIPLIB]	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	1.367054	191
	assign1-10-4 [MIPLIB]	Robert Fourer	Imported from the MIPLIB2010 submissions.	1.619376	775
	bppc8-09 [MIPLIB]	Manuel Iori	The models that we attach solve the "bar-relaxation", also known as the "Bin Packing Problem with Contiguity" or the "P\|\|Cmax with contiguity". This is one of the most interesting relaxations for two dimensional cutting and packing problems. Its solution by means of an ILP software is the bottleneck of the primal decomposition methods that we attempted in the paper cited below. In detail, the files correspond to model (12)-(15) in the paper, applied to the instances of the Classes 4, 6 and 8 by Martello and Vigo (Management Science, 1998).	1.805150	853
	bppc4-08 [MIPLIB]	Manuel Iori	The models that we attach solve the "bar-relaxation", also known as the "Bin Packing Problem with Contiguity" or the "P\|\|Cmax with contiguity". This is one of the most interesting relaxations for two dimensional cutting and packing problems. Its solution by means of an ILP software is the bottleneck of the primal decomposition methods that we attempted in the paper cited below. In detail, the files correspond to model (12)-(15) in the paper, applied to the instances of the Classes 4, 6 and 8 by Martello and Vigo (Management Science, 1998).	2.139107	947

These are model group composite (MGC) images for the MIC top 5 model groups.
Name	neos-pseudoapplication-21	generated	scp	neos-pseudoapplication-101	independentset
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.959	2 / 1.034	3 / 1.128	4 / 1.229	5 / 1.238

Model Group Summary

The table below contains summary information for the five most similar model groups to assign1-5-8 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.958791	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.	1.034130	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	1.127961	3
	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.	1.228952	4
	independentset	Toni Sorrell	These models are based on Neil Sloane's Challenge problems: Independent Sets in Graphs.	1.238077	5

Type:	Instance
Submitter:	Robert Fourer
Description:	Imported from the MIPLIB2010 submissions.
	MIPLIB Entry

Model Group Assignment from MIPLIB:	assign1
Assigned Model Group Rank/ISS in the MIC:	12 / 1.633

assign1-5-8: Instance-to-Instance Comparison Results

Parent Instance (assign1-5-8)

MIC Top 5 Instances

MIPLIB Top 5 Instances

Instance Summary

assign1-5-8: Instance-to-Model Comparison Results

MIC Top 5 Model Groups

Model Group Summary