×
neos859080: Instance-to-Instance Comparison Results
Type: | Instance |
Submitter: | NEOS Server Submission |
Description: | Imported from the MIPLIB2010 submissions. |
MIPLIB Entry |
Parent Instance (neos859080)
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 | enlight4 [MIPLIB] | gr4x6 [MIPLIB] | enlight11 [MIPLIB] | markshare_5_0 [MIPLIB] | enlight_hard [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.848 | 2 / 0.862 | 3 / 0.873 | 4 / 0.879 | 5 / 0.881 | |
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 | g503inf [MIPLIB] | gen [MIPLIB] | milo-v13-4-3d-3-0 [MIPLIB] | milo-v13-4-3d-4-0 [MIPLIB] | sp98ir [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.
|
6 / 0.883 | 134 / 1.140 | 138 / 1.145 | 206 / 1.200 | 801 / 2.030 | |
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 neos859080, the five most similar instances to neos859080 according to the MIC, and the five most similar instances to neos859080 according to MIPLIB 2017.
INSTANCE | SUBMITTER | DESCRIPTION | ISS | RANK | |
---|---|---|---|---|---|
Parent Instance | neos859080 [MIPLIB] | NEOS Server Submission | Imported from the MIPLIB2010 submissions. | 0.000000 | - |
MIC Top 5 | enlight4 [MIPLIB] | A. Zymolka | Model to solve instance of a combinatorial game ``EnLight'' Imported from the MIPLIB2010 submissions. | 0.847863 | 1 |
gr4x6 [MIPLIB] | MIPLIB submission pool | Imported from the MIPLIB2010 submissions. | 0.862347 | 2 | |
enlight11 [MIPLIB] | A. Zymolka | Model to solve instance of a combinatorial game ``EnLight'' Imported from the MIPLIB2010 submissions. | 0.873008 | 3 | |
markshare_5_0 [MIPLIB] | G. Cornuéjols, M. Dawande | Market sharing problem | 0.879350 | 4 | |
enlight_hard [MIPLIB] | A. Zymolka | Model to solve instance of a combinatorial game ``EnLight'' Imported from the MIPLIB2010 submissions. | 0.880878 | 5 | |
MIPLIB Top 5 | g503inf [MIPLIB] | MIPLIB submission pool | Imported from the MIPLIB2010 submissions. | 0.883332 | 6 |
gen [MIPLIB] | MIPLIB submission pool | Imported from the MIPLIB2010 submissions. | 1.139711 | 134 | |
milo-v13-4-3d-3-0 [MIPLIB] | Tamas Terlaky | The models come from structural design optimization where the objective is to minimize the total weight of 2 and 3 dimensional cantilevers. The 2D examples are simpler, and GuRobi can solve the 40_1 and 58_1 instances, while struggles with 75_1. The 3D examples are more challenging. The x_0 and x_1 models are two different modeling of the same identical problems, so their optimal value is the same. The 1_x and 2_x problems are solved by GuRoBi, the 3_x and 4_x are not solved in reasonable time. | 1.144529 | 138 | |
milo-v13-4-3d-4-0 [MIPLIB] | Tamas Terlaky | The models come from structural design optimization where the objective is to minimize the total weight of 2 and 3 dimensional cantilevers. The 2D examples are simpler, and GuRobi can solve the 40_1 and 58_1 instances, while struggles with 75_1. The 3D examples are more challenging. The x_0 and x_1 models are two different modeling of the same identical problems, so their optimal value is the same. The 1_x and 2_x problems are solved by GuRoBi, the 3_x and 4_x are not solved in reasonable time. | 1.199543 | 206 | |
sp98ir [MIPLIB] | J. Goessens, S. v. Hoessel, L. Kroon | Railway line planning instance | 2.029683 | 801 |
neos859080: Instance-to-Model Comparison Results
Model Group Assignment from MIPLIB: | neos-pseudoapplication-96 |
Assigned Model Group Rank/ISS in the MIC: | 8 / 1.511 |
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 | neos-pseudoapplication-74 | scp | markshare | neos-pseudoapplication-109 | neos-pseudoapplication-2 | |
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.266 | 2 / 1.305 | 3 / 1.390 | 4 / 1.434 | 5 / 1.484 |
Model Group Summary
The table below contains summary information for the five most similar model groups to neos859080 according to the MIC.
MODEL GROUP | SUBMITTER | DESCRIPTION | ISS | RANK | |
---|---|---|---|---|---|
MIC Top 5 | neos-pseudoapplication-74 | Jeff Linderoth | (None provided) | 1.266066 | 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.305168 | 2 | |
markshare | G. Cornuéjols, M. Dawande | Market sharing problem | 1.389656 | 3 | |
neos-pseudoapplication-109 | Jeff Linderoth | (None provided) | 1.433704 | 4 | |
neos-pseudoapplication-2 | NEOS Server Submission | Imported from the MIPLIB2010 submissions. | 1.483553 | 5 |