bppc6-06: 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

Parent Instance (bppc6-06)

All other instances below were be compared against this "query" instance.

bppc6-06 Raw bppc6-06 Decomposed bppc6-06 Composite of MIC top 5 bppc6-06 Composite of MIPLIB top 5 bppc6-06 Model Group Composite
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.

MIC Top 5 Instances

These are the 5 decomposed CCM images that are most similar to decomposed CCM image for the the query instance, according to the ISS metric.

Decomposed These decomposed images were created by GCG.
bppc6-02 decomposed bppc4-08 decomposed co-100 decomposed ex9 decomposed ex10 decomposed
Name bppc6-02 [MIPLIB] bppc4-08 [MIPLIB] co-100 [MIPLIB] ex9 [MIPLIB] ex10 [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.064 2 / 1.615 3 / 1.652 4 / 1.665 5 / 1.695
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIC top 5.
bppc6-02 raw bppc4-08 raw co-100 raw ex9 raw ex10 raw

MIPLIB Top 5 Instances

These are the 5 instances that are most closely related to the query instance, according to the instance statistic-based similarity measure employed by MIPLIB 2017

Decomposed These decomposed images were created by GCG.
bppc6-02 decomposed bppc4-08 decomposed assign1-10-4 decomposed bppc8-09 decomposed assign1-5-8 decomposed
Name bppc6-02 [MIPLIB] bppc4-08 [MIPLIB] assign1-10-4 [MIPLIB] bppc8-09 [MIPLIB] assign1-5-8 [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.
1 / 1.064 2 / 1.615 47 / 2.294 55 / 2.431 178 / 3.318
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIPLIB top 5.
bppc6-02 raw bppc4-08 raw assign1-10-4 raw bppc8-09 raw assign1-5-8 raw

Instance Summary

The table below contains summary information for bppc6-06, the five most similar instances to bppc6-06 according to the MIC, and the five most similar instances to bppc6-06 according to MIPLIB 2017.

INSTANCE SUBMITTER DESCRIPTION ISS RANK
Parent Instance bppc6-06 [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 bppc6-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). 1.063780 1
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). 1.615485 2
co-100 [MIPLIB] Axel Werner Model from optical access network planning 1.651795 3
ex9 [MIPLIB] Iulian Ober Formulations of Boolean SAT instance 1.664784 4
ex10 [MIPLIB] Iulian Ober Formulations of Boolean SAT instance 1.694811 5
MIPLIB Top 5 bppc6-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). 1.063780 1
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). 1.615485 2
assign1-10-4 [MIPLIB] Robert Fourer Imported from the MIPLIB2010 submissions. 2.293510 47
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). 2.431134 55
assign1-5-8 [MIPLIB] Robert Fourer Imported from the MIPLIB2010 submissions. 3.317849 178


bppc6-06: Instance-to-Model Comparison Results

Model Group Assignment from MIPLIB: bppc
Assigned Model Group Rank/ISS in the MIC: 1 / 1.267

MIC Top 5 Model Groups

These are the 5 model group composite (MGC) images that are most similar to the decomposed CCM image for the query instance, according to the ISS metric.

These are model group composite (MGC) images for the MIC top 5 model groups.
Model group: bppc Model group: neos-pseudoapplication-103 Model group: selofsubspaces Model group: neos-pseudoapplication-23 Model group: neos-pseudoapplication-106
Name bppc neos-pseudoapplication-103 selofsubspaces neos-pseudoapplication-23 neos-pseudoapplication-106
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.267 2 / 1.897 3 / 1.928 4 / 1.942 5 / 1.952

Model Group Summary

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

MODEL GROUP SUBMITTER DESCRIPTION ISS RANK
MIC Top 5 bppc 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 models of the Classes 4, 6 and 8 by Martello and Vigo (Management Science, 1998). 1.267106 1
neos-pseudoapplication-103 Hans Mittelmann Collection of anonymous submissions to the NEOS Server for Optimization 1.897202 2
selofsubspaces Daniel Heinlein Clique problems arising from a selection problem of subspaces in the PG(7,2) with different prescribed variables and numerically instable linear programming relaxation. 1.928170 3
neos-pseudoapplication-23 NEOS Server Submission Imported from the MIPLIB2010 submissions. 1.942254 4
neos-pseudoapplication-106 Hans Mittelmann Collection of anonymous submissions to the NEOS Server for Optimization 1.951555 5


Updated August 16, 2019