mod008inf: Instance-to-Instance Comparison Results

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

Parent Instance (mod008inf)

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

mod008inf Raw mod008inf Decomposed mod008inf Composite of MIC top 5 mod008inf Composite of MIPLIB top 5 mod008inf 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.
markshare2 decomposed markshare_5_0 decomposed markshare1 decomposed stein15inf decomposed markshare_4_0 decomposed
Name markshare2 [MIPLIB] markshare_5_0 [MIPLIB] markshare1 [MIPLIB] stein15inf [MIPLIB] markshare_4_0 [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.506 2 / 0.685 3 / 0.692 4 / 0.711 5 / 0.754
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIC top 5.
markshare2 raw markshare_5_0 raw markshare1 raw stein15inf raw markshare_4_0 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.
p2m2p1m1p0n100 decomposed probportfolio decomposed neos5 decomposed n2seq36f decomposed neos-885524 decomposed
Name p2m2p1m1p0n100 [MIPLIB] probportfolio [MIPLIB] neos5 [MIPLIB] n2seq36f [MIPLIB] neos-885524 [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.
19 / 0.929 44 / 0.995 601 / 1.524 780 / 1.886 846 / 2.089
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIPLIB top 5.
p2m2p1m1p0n100 raw probportfolio raw neos5 raw n2seq36f raw neos-885524 raw

Instance Summary

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

INSTANCE SUBMITTER DESCRIPTION ISS RANK
Parent Instance mod008inf [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 0.000000 -
MIC Top 5 markshare2 [MIPLIB] G. Cornuéjols, M. Dawande Market sharing problem 0.505685 1
markshare_5_0 [MIPLIB] G. Cornuéjols, M. Dawande Market sharing problem 0.685273 2
markshare1 [MIPLIB] G. Cornuéjols, M. Dawande Market sharing problem 0.691980 3
stein15inf [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 0.710930 4
markshare_4_0 [MIPLIB] G. Cornuéjols, M. Dawande Market sharing problem 0.753551 5
MIPLIB Top 5 p2m2p1m1p0n100 [MIPLIB] B. Krishnamoorthy, G. Pataki A 0-1 knapsack problem constructed to be difficult 0.929155 19
probportfolio [MIPLIB] Feng Qiu Sample average approximation formulation of a probabilistic portfolio optimization problem. Solved using ug[SCIP/spx], a distributed massively parallel version of SCIP run on 2,000 cores at the HLRN-II super computer facility. 0.994727 44
neos5 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. 1.524318 601
n2seq36f [MIPLIB] R. Meirich Static line planning models on the Dutch IC network 1.886229 780
neos-885524 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application 2.088711 846


mod008inf: Instance-to-Model Comparison Results

Model Group Assignment from MIPLIB: mod
Assigned Model Group Rank/ISS in the MIC: 125 / 2.645

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: markshare Model group: scp Model group: stein Model group: neos-pseudoapplication-74 Model group: neos-pseudoapplication-21
Name markshare scp stein neos-pseudoapplication-74 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 / 0.967 2 / 1.103 3 / 1.229 4 / 1.332 5 / 1.436

Model Group Summary

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

MODEL GROUP SUBMITTER DESCRIPTION ISS RANK
MIC Top 5 markshare G. Cornuéjols, M. Dawande Market sharing problem 0.967036 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.103386 2
stein MIPLIB submission pool Imported from the MIPLIB2010 submissions. 1.228575 3
neos-pseudoapplication-74 Jeff Linderoth (None provided) 1.331701 4
neos-pseudoapplication-21 NEOS Server Submission Imported from the MIPLIB2010 submissions. 1.436094 5