h50x2450: Instance-to-Instance Comparison Results

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

Parent Instance (h50x2450)

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

h50x2450 Raw h50x2450 Decomposed h50x2450 Composite of MIC top 5 h50x2450 Composite of MIPLIB top 5 h50x2450 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.
h80x6320d decomposed neos-1112787 decomposed neos-1112782 decomposed neos-873061 decomposed neos-872648 decomposed
Name h80x6320d [MIPLIB] neos-1112787 [MIPLIB] neos-1112782 [MIPLIB] neos-873061 [MIPLIB] neos-872648 [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.432 2 / 0.573 3 / 0.580 4 / 0.652 5 / 0.652
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIC top 5.
h80x6320d raw neos-1112787 raw neos-1112782 raw neos-873061 raw neos-872648 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.
n3707 decomposed n370b decomposed n3700 decomposed n3709 decomposed n3705 decomposed
Name n3707 [MIPLIB] n370b* [MIPLIB] n3700* [MIPLIB] n3709* [MIPLIB] n3705* [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.
190 / 1.292 190* / 1.292* 190* / 1.292* 190* / 1.292* 190* / 1.292*
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIPLIB top 5.
n3707 raw n370b raw n3700 raw n3709 raw n3705 raw

Instance Summary

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

INSTANCE SUBMITTER DESCRIPTION ISS RANK
Parent Instance h50x2450 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 0.000000 -
MIC Top 5 h80x6320d [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 0.431590 1
neos-1112787 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application 0.573154 2
neos-1112782 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application 0.580423 3
neos-873061 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. 0.652433 4
neos-872648 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. 0.652444 5
MIPLIB Top 5 n3707 [MIPLIB] J. Aronson Fixed charge transportation problem 1.292013 190
n370b* [MIPLIB] J. Aronson Fixed charge transportation problem 1.292013* 190*
n3700* [MIPLIB] J. Aronson Fixed charge transportation problem 1.292013* 190*
n3709* [MIPLIB] J. Aronson Fixed charge transportation problem 1.292013* 190*
n3705* [MIPLIB] J. Aronson Fixed charge transportation problem 1.292013* 190*


h50x2450: Instance-to-Model Comparison Results

Model Group Assignment from MIPLIB: fixed-cost-network-flow
Assigned Model Group Rank/ISS in the MIC: 13 / 1.702

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: neos-pseudoapplication-89 Model group: drayage Model group: square Model group: neos-pseudoapplication-74 Model group: scp
Name neos-pseudoapplication-89 drayage square neos-pseudoapplication-74 scp
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.806 2 / 1.455 3 / 1.464 4 / 1.486 5 / 1.515

Model Group Summary

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

MODEL GROUP SUBMITTER DESCRIPTION ISS RANK
MIC Top 5 neos-pseudoapplication-89 NEOS Server Submission Model coming from the NEOS Server with unknown application 0.806352 1
drayage F. Jordan Srour The .rar file contains three folders: 1) R_mps with all of the models (165, organized into 5 groups R0_, R25_, R50_, R75_, and R100_*), 2) results_and_runtimes with datafiles on the runtime and results, and 3) doc with documentation on the models in the form of a pdf. 1.454764 2
square Sascha Kurz Squaring the square For a given integer n, determine the minimum number of squares in a tiling of an \\(n\\times n\\) square using using only integer sided squares of smaller size. (Although the models get quite large even for moderate n, they can be solved to optimality for all \\(n \\le 61\\), while challenging the MIP solver, especially the presolver.) 1.463582 3
neos-pseudoapplication-74 Jeff Linderoth (None provided) 1.486396 4
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.514669 5


* n370b is a duplicate of n3707. n3700 is a duplicate of n3707. n3709 is a duplicate of n3707. n3705 is a duplicate of n3707.