Instance - bppc8-02

bppc8-02: Instance-to-Instance Comparison Results

Type:	Instance
Submitter:	Manuel Iori
Description:	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).
	MIPLIB Entry


	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	assign1-5-8 [MIPLIB]	mad [MIPLIB]	gen-ip002 [MIPLIB]	gen-ip054 [MIPLIB]	gen-ip021 [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.878	2 / 0.895	3 / 0.906	4 / 0.917	5 / 0.924
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	g503inf [MIPLIB]	ran14x18-disj-8 [MIPLIB]	gr4x6 [MIPLIB]	neos-480878 [MIPLIB]	ns1830653 [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.	99 / 1.368	159 / 1.416	248 / 1.460	908 / 2.047	921 / 2.126
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 bppc8-02, the five most similar instances to bppc8-02 according to the MIC, and the five most similar instances to bppc8-02 according to MIPLIB 2017.

	INSTANCE	SUBMITTER	DESCRIPTION	ISS	RANK
Parent Instance	bppc8-02 [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).	0.000000	-
MIC Top 5	assign1-5-8 [MIPLIB]	Robert Fourer	Imported from the MIPLIB2010 submissions.	0.878057	1
	mad [MIPLIB]	Koichi Fujii	Mean-Absolute Deviation Model for Car Dealerships	0.895285	2
	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.906135	3
	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.917064	4
	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.924418	5
MIPLIB Top 5	g503inf [MIPLIB]	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	1.368086	99
	ran14x18-disj-8 [MIPLIB]	J. Aronson	Fixed charge transportation problem	1.416202	159
	gr4x6 [MIPLIB]	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	1.459640	248
	neos-480878 [MIPLIB]	NEOS Server Submission	Imported from the MIPLIB2010 submissions.	2.046754	908
	ns1830653 [MIPLIB]	NEOS Server Submission	Instance coming from the NEOS Server with unknown application	2.125693	921

bppc8-02: Instance-to-Model Comparison Results

Model Group Assignment from MIPLIB:	bppc
Assigned Model Group Rank/ISS in the MIC:	222 / 3.198

These are model group composite (MGC) images for the MIC top 5 model groups.
Name	neos-pseudoapplication-21	scp	generated	markshare	stein
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.253	2 / 1.364	3 / 1.416	4 / 1.426	5 / 1.521

Model Group Summary

The table below contains summary information for the five most similar model groups to bppc8-02 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.252586	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.364490	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.415614	3
	markshare	G. Cornuéjols, M. Dawande	Market sharing problem	1.426251	4
	stein	MIPLIB submission pool	Imported from the MIPLIB2010 submissions.	1.521079	5

bppc8-02: Instance-to-Instance Comparison Results

Parent Instance (bppc8-02)

MIC Top 5 Instances

MIPLIB Top 5 Instances

Instance Summary

bppc8-02: Instance-to-Model Comparison Results

MIC Top 5 Model Groups

Model Group Summary