bppc4-08: 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 (bppc4-08)

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

bppc4-08 Raw bppc4-08 Decomposed bppc4-08 Composite of MIC top 5 bppc4-08 Composite of MIPLIB top 5 bppc4-08 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 core4872-1529 decomposed f2000 decomposed trento1 decomposed reblock354 decomposed
Name bppc6-02 [MIPLIB] core4872-1529 [MIPLIB] f2000 [MIPLIB] trento1 [MIPLIB] reblock354 [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.270 2 / 1.373 3 / 1.427 4 / 1.451 5 / 1.461
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIC top 5.
bppc6-02 raw core4872-1529 raw f2000 raw trento1 raw reblock354 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 bppc8-09 decomposed assign1-10-4 decomposed bppc6-06 decomposed assign1-5-8 decomposed
Name bppc6-02 [MIPLIB] bppc8-09 [MIPLIB] assign1-10-4 [MIPLIB] bppc6-06 [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.270 9 / 1.479 22 / 1.610 24 / 1.615 134 / 2.139
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIPLIB top 5.
bppc6-02 raw bppc8-09 raw assign1-10-4 raw bppc6-06 raw assign1-5-8 raw

Instance Summary

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

INSTANCE SUBMITTER DESCRIPTION ISS RANK
Parent Instance 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). 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.269849 1
core4872-1529 [MIPLIB] A. Caprara, M. Fischetti, P. Toth Set covering instance coming from Italian railway models 1.373149 2
f2000 [MIPLIB] M. Winkler Reformulated SAT instance from the 2010 SAT conference pseudo-Boolean competition 1.427464 3
trento1 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 1.451123 4
reblock354 [MIPLIB] Andreas Bley Multi-period mine production scheduling instance. 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.461326 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.269849 1
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.478610 9
assign1-10-4 [MIPLIB] Robert Fourer Imported from the MIPLIB2010 submissions. 1.610238 22
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). 1.615485 24
assign1-5-8 [MIPLIB] Robert Fourer Imported from the MIPLIB2010 submissions. 2.139107 134


bppc4-08: Instance-to-Model Comparison Results

Model Group Assignment from MIPLIB: bppc
Assigned Model Group Rank/ISS in the MIC: 87 / 2.381

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: f2gap Model group: generated Model group: independentset Model group: neos-pseudoapplication-21 Model group: neos-pseudoapplication-101
Name f2gap generated independentset neos-pseudoapplication-21 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 / 1.459 2 / 1.466 3 / 1.515 4 / 1.521 5 / 1.573

Model Group Summary

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

MODEL GROUP SUBMITTER DESCRIPTION ISS RANK
MIC Top 5 f2gap Salim Haddadi Restrictions of well-known hard generalized assignment problem models (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600) 1.458988 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.466068 2
independentset Toni Sorrell These models are based on Neil Sloane's Challenge problems: Independent Sets in Graphs. 1.514781 3
neos-pseudoapplication-21 NEOS Server Submission Imported from the MIPLIB2010 submissions. 1.521391 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. 1.573171 5


Updated August 16, 2019