22433: Instance-to-Instance Comparison Results

Type: Instance
Submitter: MIPLIB submission pool
Description: Imported from the MIPLIB2010 submissions.
MIPLIB Entry

Parent Instance (22433)

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

22433 Raw 22433 Decomposed 22433 Composite of MIC top 5 22433 Composite of MIPLIB top 5 22433 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.
23588 decomposed pk1 decomposed qnet1_o decomposed f2gap40400 decomposed bppc8-02 decomposed
Name 23588 [MIPLIB] pk1 [MIPLIB] qnet1_o [MIPLIB] f2gap40400 [MIPLIB] bppc8-02 [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.935 2 / 1.183 3 / 1.190 4 / 1.230 5 / 1.239
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIC top 5.
23588 raw pk1 raw qnet1_o raw f2gap40400 raw bppc8-02 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.
23588 decomposed csched010 decomposed neos-2624317-amur decomposed nh97_tension decomposed biella1 decomposed
Name 23588 [MIPLIB] csched010 [MIPLIB] neos-2624317-amur [MIPLIB] nh97_tension [MIPLIB] biella1 [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 / 0.935 75 / 1.459 257 / 1.592 675 / 1.766 909 / 2.230
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIPLIB top 5.
23588 raw csched010 raw neos-2624317-amur raw nh97_tension raw biella1 raw

Instance Summary

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

INSTANCE SUBMITTER DESCRIPTION ISS RANK
Parent Instance 22433 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 0.000000 -
MIC Top 5 23588 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 0.935404 1
pk1 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 1.183245 2
qnet1_o [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 1.190314 3
f2gap40400 [MIPLIB] Salim Haddadi Restrictions of well-known hard generalized assignment problem instances (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600) 1.229811 4
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). 1.239472 5
MIPLIB Top 5 23588 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 0.935404 1
csched010 [MIPLIB] Tallys Yunes Cumulative scheduling problem instance 1.458956 75
neos-2624317-amur [MIPLIB] Jeff Linderoth (None provided) 1.591707 257
nh97_tension [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 1.765976 675
biella1 [MIPLIB] Double-Click SAS Crew scheduling instance 2.229910 909


22433: Instance-to-Model Comparison Results

Model Group Assignment from MIPLIB: no model group assignment
Assigned Model Group Rank/ISS in the MIC: N.A. / N.A.

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: scp Model group: enlight Model group: stein Model group: bmocbd Model group: neos-pseudoapplication-21
Name scp enlight stein bmocbd neos-pseudoapplication-21
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.550 2 / 1.566 3 / 1.646 4 / 1.666 5 / 1.667

Model Group Summary

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

MODEL GROUP SUBMITTER DESCRIPTION ISS RANK
MIC Top 5 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.550421 1
enlight A. Zymolka Model to solve model of a combinatorial game ``EnLight'' Imported from the MIPLIB2010 submissions. 1.565888 2
stein MIPLIB submission pool Imported from the MIPLIB2010 submissions. 1.646186 3
bmocbd Sean MacDermant BMOCBD2 1.665756 4
neos-pseudoapplication-21 NEOS Server Submission Imported from the MIPLIB2010 submissions. 1.666895 5