mine-166-5: Instance-to-Instance Comparison Results

Type: Instance
Submitter: Andreas Bley
Description: Multi-period mine production scheduling instance
MIPLIB Entry

Parent Instance (mine-166-5)

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

mine-166-5 Raw mine-166-5 Decomposed mine-166-5 Composite of MIC top 5 mine-166-5 Composite of MIPLIB top 5 mine-166-5 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.
reblock166 decomposed mine-90-10 decomposed f2gap801600 decomposed neos5 decomposed pythago7825 decomposed
Name reblock166 [MIPLIB] mine-90-10 [MIPLIB] f2gap801600 [MIPLIB] neos5 [MIPLIB] pythago7825 [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.688 2 / 0.725 3 / 1.013 4 / 1.023 5 / 1.026
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIC top 5.
reblock166 raw mine-90-10 raw f2gap801600 raw neos5 raw pythago7825 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.
reblock166 decomposed mine-90-10 decomposed reblock115 decomposed reblock354 decomposed reblock420 decomposed
Name reblock166 [MIPLIB] mine-90-10 [MIPLIB] reblock115 [MIPLIB] reblock354 [MIPLIB] reblock420 [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.688 2 / 0.725 14 / 1.138 96 / 1.595 97 / 1.598
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIPLIB top 5.
reblock166 raw mine-90-10 raw reblock115 raw reblock354 raw reblock420 raw

Instance Summary

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

INSTANCE SUBMITTER DESCRIPTION ISS RANK
Parent Instance mine-166-5 [MIPLIB] Andreas Bley Multi-period mine production scheduling instance 0.000000 -
MIC Top 5 reblock166 [MIPLIB] Andreas Bley Multi-period mine production scheduling instance 0.687892 1
mine-90-10 [MIPLIB] Andreas Bley Multi-period mine production scheduling instance 0.724999 2
f2gap801600 [MIPLIB] Salim Haddadi Restrictions of well-known hard generalized assignment problem instances (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600) 1.012571 3
neos5 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. 1.023138 4
pythago7825 [MIPLIB] Felix J. L. Willamowski 2-coloring of Pythagorean triples 1.025797 5
MIPLIB Top 5 reblock166 [MIPLIB] Andreas Bley Multi-period mine production scheduling instance 0.687892 1
mine-90-10 [MIPLIB] Andreas Bley Multi-period mine production scheduling instance 0.724999 2
reblock115 [MIPLIB] Andreas Bley Multi-period mine production scheduling instances 1.138389 14
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.595393 96
reblock420 [MIPLIB] Andreas Bley Multi-period mine production scheduling instance 1.598357 97


mine-166-5: Instance-to-Model Comparison Results

Model Group Assignment from MIPLIB: mine
Assigned Model Group Rank/ISS in the MIC: 1 / 0.764

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: mine Model group: independentset Model group: generated Model group: assign1 Model group: 2hopcds
Name mine independentset generated assign1 2hopcds
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.765 2 / 1.441 3 / 1.469 4 / 1.531 5 / 1.543

Model Group Summary

The table below contains summary information for the five most similar model groups to mine-166-5 according to the MIC.

MODEL GROUP SUBMITTER DESCRIPTION ISS RANK
MIC Top 5 mine Andreas Bley Multi-period mine production scheduling model 0.764892 1
independentset Toni Sorrell These models are based on Neil Sloane's Challenge problems: Independent Sets in Graphs. 1.440582 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.468682 3
assign1 Robert Fourer Imported from the MIPLIB2010 submissions. 1.530746 4
2hopcds Austin Buchanan A problem in wireless networks. The objective is to select a minimum number of relay nodes so that any two nonadjacent nodes can communicate by way of the chosen relay nodes in at most s hops, where s is a problem input. The 2-hop case of this problem can be formulated as a set cover/hitting set problem with n binary variables and n^2 constraints: _{ k N(i) N(j) } x_k 1 for nonadjacent node pairs {i,j}. Despite the formulation's simplicity, models with as few as 120 variables are left unsolved after one hour using Gurobi 7.0.2. 1.542987 5