rmine11: Instance-to-Instance Comparison Results

Type: Instance
Submitter: Daniel Espinoza
Description: Set of instances comming from open pit minning over a cube and several time periods and two knapsack constraints per period
MIPLIB Entry

Parent Instance (rmine11)

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

rmine11 Raw rmine11 Decomposed rmine11 Composite of MIC top 5 rmine11 Composite of MIPLIB top 5 rmine11 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.
rmine13 decomposed rmine15 decomposed rmine21 decomposed noswot decomposed neos-4562542-watut decomposed
Name rmine13 [MIPLIB] rmine15 [MIPLIB] rmine21 [MIPLIB] noswot [MIPLIB] neos-4562542-watut [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.462 2 / 0.542 3 / 0.689 4 / 1.302 5 / 1.355
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIC top 5.
rmine13 raw rmine15 raw rmine21 raw noswot raw neos-4562542-watut 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.
rmine13 decomposed rmine15 decomposed opm2-z7-s8 decomposed opm2-z8-s0 decomposed opm2-z10-s4 decomposed
Name rmine13 [MIPLIB] rmine15 [MIPLIB] opm2-z7-s8 [MIPLIB] opm2-z8-s0 [MIPLIB] opm2-z10-s4 [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.462 2 / 0.542 888 / 2.427 904 / 2.510 914 / 2.549
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIPLIB top 5.
rmine13 raw rmine15 raw opm2-z7-s8 raw opm2-z8-s0 raw opm2-z10-s4 raw

Instance Summary

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

INSTANCE SUBMITTER DESCRIPTION ISS RANK
Parent Instance rmine11 [MIPLIB] Daniel Espinoza Set of instances comming from open pit minning over a cube and several time periods and two knapsack constraints per period 0.000000 -
MIC Top 5 rmine13 [MIPLIB] Daniel Espinoza Set of instances comming from open pit minning over a cube and several time periods and two knapsack constraints per period 0.462195 1
rmine15 [MIPLIB] Daniel Espinoza Set of instances comming from open pit minning over a cube and several time periods and two knapsack constraints per period 0.542137 2
rmine21 [MIPLIB] Daniel Espinoza Instance coming from open pit mining over a cube considering multiple time periods and two knapsack constraints per period 0.688790 3
noswot [MIPLIB] J. Gregory, L. Schrage Unknown application 1.302151 4
neos-4562542-watut [MIPLIB] Jeff Linderoth (None provided) 1.355473 5
MIPLIB Top 5 rmine13 [MIPLIB] Daniel Espinoza Set of instances comming from open pit minning over a cube and several time periods and two knapsack constraints per period 0.462195 1
rmine15 [MIPLIB] Daniel Espinoza Set of instances comming from open pit minning over a cube and several time periods and two knapsack constraints per period 0.542137 2
opm2-z7-s8 [MIPLIB] Daniel Espinoza Problems coming from precedence constrained knapsacks arising in mining applications. These are one-period problems with integer data but large root LP GAP 2.427470 888
opm2-z8-s0 [MIPLIB] Daniel Espinoza Problems coming from precedence constrained knapsacks arising in mining applications. These are one-period problems with integer data but large root LP GAP 2.509531 904
opm2-z10-s4 [MIPLIB] Daniel Espinoza Problems coming from precedence constrained knapsacks arising in mining applications. These are one-period problems with integer data but large root LP GAP 2.549387 914


rmine11: Instance-to-Model Comparison Results

Model Group Assignment from MIPLIB: rmine
Assigned Model Group Rank/ISS in the MIC: 1 / 0.719

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: rmine Model group: scp Model group: markshare Model group: enlight Model group: stein
Name rmine scp markshare enlight 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 / 0.719 2 / 1.797 3 / 1.840 4 / 1.852 5 / 1.896

Model Group Summary

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

MODEL GROUP SUBMITTER DESCRIPTION ISS RANK
MIC Top 5 rmine Daniel Espinoza Set of models comming from open pit minning over a cube and several time periods and two knapsack constraints per period 0.719135 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.797017 2
markshare G. Cornuéjols, M. Dawande Market sharing problem 1.840261 3
enlight A. Zymolka Model to solve model of a combinatorial game ``EnLight'' Imported from the MIPLIB2010 submissions. 1.851563 4
stein MIPLIB submission pool Imported from the MIPLIB2010 submissions. 1.895518 5


Updated August 16, 2019