×
milo-v13-4-3d-3-0: Instance-to-Instance Comparison Results
Type: | Instance |
Submitter: | Tamas Terlaky |
Description: | 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. |
MIPLIB Entry |
Parent Instance (milo-v13-4-3d-3-0)
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 | neos-3118745-obra [MIPLIB] | beasleyC3 [MIPLIB] | beasleyC1 [MIPLIB] | beavma [MIPLIB] | r50x360 [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.612 | 2 / 0.632 | 3 / 0.642 | 4 / 0.645 | 5 / 0.655 | |
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 | milo-v12-6-r2-40-1 [MIPLIB] | milo-v12-6-r1-58-1 [MIPLIB] | milo-v12-6-r1-75-1 [MIPLIB] | milo-v13-4-3d-4-0 [MIPLIB] | supportcase17 [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.
|
48 / 0.840 | 64 / 0.885 | 77 / 0.901 | 162 / 1.027 | 410 / 1.369 | |
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 milo-v13-4-3d-3-0, the five most similar instances to milo-v13-4-3d-3-0 according to the MIC, and the five most similar instances to milo-v13-4-3d-3-0 according to MIPLIB 2017.
INSTANCE | SUBMITTER | DESCRIPTION | ISS | RANK | |
---|---|---|---|---|---|
Parent Instance | 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. | 0.000000 | - |
MIC Top 5 | neos-3118745-obra [MIPLIB] | Jeff Linderoth | (None provided) | 0.611751 | 1 |
beasleyC3 [MIPLIB] | F. Ortega, L. Wolsey | Fixed cost network flow problems | 0.632269 | 2 | |
beasleyC1 [MIPLIB] | F. Ortega, L. Wolsey | Fixed cost network flow problems | 0.641894 | 3 | |
beavma [MIPLIB] | MIPLIB submission pool | Imported from the MIPLIB2010 submissions. | 0.645469 | 4 | |
r50x360 [MIPLIB] | MIPLIB submission pool | Imported from the MIPLIB2010 submissions. | 0.655038 | 5 | |
MIPLIB Top 5 | milo-v12-6-r2-40-1 [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. | 0.840079 | 48 |
milo-v12-6-r1-58-1 [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. | 0.884558 | 64 | |
milo-v12-6-r1-75-1 [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. | 0.900720 | 77 | |
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.026717 | 162 | |
supportcase17 [MIPLIB] | Michael Winkler | MIP instances collected from Gurobi forum with unknown application | 1.369353 | 410 |
milo-v13-4-3d-3-0: Instance-to-Model Comparison Results
Model Group Assignment from MIPLIB: | milo |
Assigned Model Group Rank/ISS in the MIC: | 21 / 1.618 |
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-2 | noip | beasley | ab | sp_product | |
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.018 | 2 / 1.068 | 3 / 1.236 | 4 / 1.238 | 5 / 1.252 |
Model Group Summary
The table below contains summary information for the five most similar model groups to milo-v13-4-3d-3-0 according to the MIC.
MODEL GROUP | SUBMITTER | DESCRIPTION | ISS | RANK | |
---|---|---|---|---|---|
MIC Top 5 | neos-pseudoapplication-2 | NEOS Server Submission | Imported from the MIPLIB2010 submissions. | 1.018427 | 1 |
noip | Christopher Hojny | integer programming formulation that verifies that no integer programming formulation of a given 0/1-point set exists | 1.068401 | 2 | |
beasley | F. Ortega, L. Wolsey | Fixed cost network flow problems | 1.235800 | 3 | |
ab | MIPLIB submission pool | Imported from the MIPLIB2010 submissions. | 1.237810 | 4 | |
sp_product | MIPLIB submission pool | Imported from the MIPLIB2010 submissions. | 1.252161 | 5 |