×
genus-sym-g62-2: Instance-to-Instance Comparison Results
Type: | Instance |
Submitter: | Stephan Beyer |
Description: | Minimum Genus instance, with symmetry breaking constraints, of g.62.2 (undirected) of the AT&T Graphs by Stephen C. North. |
MIPLIB Entry |
Parent Instance (genus-sym-g62-2)
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 | f2000 [MIPLIB] | neos-5189128-totara [MIPLIB] | genus-sym-grafo5708-48 [MIPLIB] | mod010 [MIPLIB] | f2gap801600 [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.972 | 2 / 1.137 | 3 / 1.184 | 4 / 1.187 | 5 / 1.188 | |
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 | genus-sym-grafo5708-48 [MIPLIB] | genus-g61-25 [MIPLIB] | supportcase10 [MIPLIB] | neos-3230376-yser [MIPLIB] | neos-950242 [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.
|
3 / 1.184 | 322 / 2.093 | 399 / 2.146 | 446 / 2.171 | 703 / 2.323 | |
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 genus-sym-g62-2, the five most similar instances to genus-sym-g62-2 according to the MIC, and the five most similar instances to genus-sym-g62-2 according to MIPLIB 2017.
INSTANCE | SUBMITTER | DESCRIPTION | ISS | RANK | |
---|---|---|---|---|---|
Parent Instance | genus-sym-g62-2 [MIPLIB] | Stephan Beyer | Minimum Genus instance, with symmetry breaking constraints, of g.62.2 (undirected) of the AT&T Graphs by Stephen C. North. | 0.000000 | - |
MIC Top 5 | f2000 [MIPLIB] | M. Winkler | Reformulated SAT instance from the 2010 SAT conference pseudo-Boolean competition | 0.971979 | 1 |
neos-5189128-totara [MIPLIB] | Hans Mittelmann | distribution of fruit | 1.137151 | 2 | |
genus-sym-grafo5708-48 [MIPLIB] | Stephan Beyer | Minimum Genus instance of grafo5708.48 from the Rome Graphs, with symmetry-breaking constraints. | 1.183632 | 3 | |
mod010 [MIPLIB] | MIPLIB submission pool | Imported from the MIPLIB2010 submissions. | 1.187103 | 4 | |
f2gap801600 [MIPLIB] | Salim Haddadi | Restrictions of well-known hard generalized assignment problem instances (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600) | 1.188404 | 5 | |
MIPLIB Top 5 | genus-sym-grafo5708-48 [MIPLIB] | Stephan Beyer | Minimum Genus instance of grafo5708.48 from the Rome Graphs, with symmetry-breaking constraints. | 1.183632 | 3 |
genus-g61-25 [MIPLIB] | Stephan Beyer | Minimum Genus instance of g.61.25 (undirected) of the AT&T Graphs by Stephen C. North. | 2.093301 | 322 | |
supportcase10 [MIPLIB] | Michael Winkler | MIP instances collected from Gurobi forum with unknown application | 2.145721 | 399 | |
neos-3230376-yser [MIPLIB] | Jeff Linderoth | (None provided) | 2.171199 | 446 | |
neos-950242 [MIPLIB] | NEOS Server Submission | Imported from the MIPLIB2010 submissions. | 2.323158 | 703 |
genus-sym-g62-2: Instance-to-Model Comparison Results
Model Group Assignment from MIPLIB: | genus |
Assigned Model Group Rank/ISS in the MIC: | 1 / 1.519 |
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 | genus | assign1 | mine | 2hopcds | maxfeassub | |
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.520 | 2 / 1.694 | 3 / 1.783 | 4 / 1.785 | 5 / 1.797 |
Model Group Summary
The table below contains summary information for the five most similar model groups to genus-sym-g62-2 according to the MIC.
MODEL GROUP | SUBMITTER | DESCRIPTION | ISS | RANK | |
---|---|---|---|---|---|
MIC Top 5 | genus | Stephan Beyer | Minimum Genus model, with symmetry breaking constraints, of g.31.8 (undirected) of the AT&T Graphs by Stephen C. North. | 1.519727 | 1 |
assign1 | Robert Fourer | Imported from the MIPLIB2010 submissions. | 1.694177 | 2 | |
mine | Andreas Bley | Multi-period mine production scheduling model | 1.783066 | 3 | |
2hopcds | Austin Buchanan | A problem in wireless networks. The objective is to select a minimum number of relay nodes so that any two nonadjacent nodes can communicate by way of the chosen relay nodes in at most s hops, where s is a problem input. The 2-hop case of this problem can be formulated as a set cover/hitting set problem with n binary variables and n^2 constraints: _{ k N(i) N(j) } x_k 1 for nonadjacent node pairs {i,j}. Despite the formulation's simplicity, models with as few as 120 variables are left unsolved after one hour using Gurobi 7.0.2. | 1.785056 | 4 | |
maxfeassub | Marc Pfetsch | Set covering problems arising from a Benders algorithm for finding maximum feasible subsystems. More details on the generation is given in the README file in the tarball. | 1.797200 | 5 |