×
ger50-17-trans-dfn-3t: Instance-to-Instance Comparison Results
Type: | Instance |
Submitter: | C. Raack |
Description: | Multi-layer network design problem using a link-flow formulation over a path-flow formulation. |
MIPLIB Entry |
Parent Instance (ger50-17-trans-dfn-3t)
All other instances below were be compared against this "query" instance.![]() ![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
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.
|
![]() |
![]() |
![]() |
![]() |
![]() |
Name | ger50_17_trans [MIPLIB] | highschool1-aigio [MIPLIB] | ran14x18-disj-8 [MIPLIB] | osorio-cta [MIPLIB] | neos-1445532 [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.219 | 2 / 1.382 | 3 / 1.464 | 4 / 1.505 | 5 / 1.631 | |
Raw
These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIC top 5.
|
![]() |
![]() |
![]() |
![]() |
![]() |
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.
|
![]() |
![]() |
![]() |
![]() |
![]() |
Name | ger50_17_trans [MIPLIB] | ger50-17-ptp-pop-6t [MIPLIB] | ta1-UUM [MIPLIB] | ger50-17-trans-pop-3t* [MIPLIB] | ger50-17-ptp-pop-3t* [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.219 | 11 / 1.686 | 465 / 2.264 | 1* / 0.219* | 11* / 1.686* | |
Raw
These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIPLIB top 5.
|
![]() |
![]() |
![]() |
![]() |
![]() |
Instance Summary
The table below contains summary information for ger50-17-trans-dfn-3t, the five most similar instances to ger50-17-trans-dfn-3t according to the MIC, and the five most similar instances to ger50-17-trans-dfn-3t according to MIPLIB 2017.
INSTANCE | SUBMITTER | DESCRIPTION | ISS | RANK | |
---|---|---|---|---|---|
Parent Instance | ger50-17-trans-dfn-3t [MIPLIB] | C. Raack | Multi-layer network design problem using a link-flow formulation over a path-flow formulation. | 0.000000 | - |
MIC Top 5 | ger50_17_trans [MIPLIB] | C. Raack | Multi-layer network design problem using a link-flow formulation over a path-flow formulation. | 0.218845 | 1 |
highschool1-aigio [MIPLIB] | George Fonseca | Educational timetabling problems from several real schools/universities around the world. These instances were originally expressed in the xhstt file format [1] and formulated as Integer Programming models as described at [2]. | 1.382279 | 2 | |
ran14x18-disj-8 [MIPLIB] | J. Aronson | Fixed charge transportation problem | 1.463906 | 3 | |
osorio-cta [MIPLIB] | Jordi Castro | Set of MILP instances of the CTA (Controlled Tabular Adjustment) problem, a method to protect statistical tabular data, belonging to the field of SDC (Statistical Disclosure Control). Raw data of instances are real or pseudo-real, provided by several National Statistical Agencies. We generated the CTA problem for these data. | 1.505250 | 4 | |
neos-1445532 [MIPLIB] | NEOS Server Submission | Imported from the MIPLIB2010 submissions. | 1.631482 | 5 | |
MIPLIB Top 5 | ger50_17_trans [MIPLIB] | C. Raack | Multi-layer network design problem using a link-flow formulation over a path-flow formulation. | 0.218845 | 1 |
ger50-17-ptp-pop-6t [MIPLIB] | C. Raack | Multi-layer network design problem using a link-flow formulation over a path-flow formulation. | 1.686482 | 11 | |
ta1-UUM [MIPLIB] | MIPLIB submission pool | Imported from the MIPLIB2010 submissions. | 2.264233 | 465 | |
ger50-17-trans-pop-3t* [MIPLIB] | C. Raack | Multi-layer network design problem using a link-flow formulation over a path-flow formulation. | 0.218845* | 1* | |
ger50-17-ptp-pop-3t* [MIPLIB] | C. Raack | Multi-layer network design problem using a link-flow formulation over a path-flow formulation. | 1.686482* | 11* |
ger50-17-trans-dfn-3t: Instance-to-Model Comparison Results
Model Group Assignment from MIPLIB: | ger50 |
Assigned Model Group Rank/ISS in the MIC: | 1 / 1.736 |
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.
|
![]() |
![]() |
![]() |
![]() |
![]() |
Name | ger50 | neos-pseudoapplication-108 | ran | scp | 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.737 | 2 / 2.255 | 3 / 2.272 | 4 / 2.380 | 5 / 2.391 |
Model Group Summary
The table below contains summary information for the five most similar model groups to ger50-17-trans-dfn-3t according to the MIC.
MODEL GROUP | SUBMITTER | DESCRIPTION | ISS | RANK | |
---|---|---|---|---|---|
MIC Top 5 | ger50 | C. Raack | Multi-layer network design problem using a link-flow formulation over a path-flow formulation. | 1.736703 | 1 |
neos-pseudoapplication-108 | NEOS Server Submission | Model coming from the NEOS Server with unknown application | 2.255385 | 2 | |
ran | J. Aronson | Fixed charge transportation problem | 2.272044 | 3 | |
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 | 2.380178 | 4 | |
neos-pseudoapplication-21 | NEOS Server Submission | Imported from the MIPLIB2010 submissions. | 2.390531 | 5 |