pythago7825: Instance-to-Instance Comparison Results

Type: Instance
Submitter: Felix J. L. Willamowski
Description: 2-coloring of Pythagorean triples
MIPLIB Entry

Parent Instance (pythago7825)

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

pythago7825 Raw pythago7825 Decomposed pythago7825 Composite of MIC top 5 pythago7825 Composite of MIPLIB top 5 pythago7825 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.
pythago7824 decomposed 2club200v15p5scn decomposed iis-hc-cov decomposed eil33-2 decomposed neos-5189128-totara decomposed
Name pythago7824 [MIPLIB] 2club200v15p5scn [MIPLIB] iis-hc-cov [MIPLIB] eil33-2 [MIPLIB] neos-5189128-totara [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.643 2 / 0.707 3 / 0.716 4 / 0.723 5 / 0.747
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIC top 5.
pythago7824 raw 2club200v15p5scn raw iis-hc-cov raw eil33-2 raw neos-5189128-totara 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.
pythago7824 decomposed neos-4382714-ruvuma decomposed ponderthis0517-inf decomposed supportcase30 decomposed fhnw-binpack4-18 decomposed
Name pythago7824 [MIPLIB] neos-4382714-ruvuma [MIPLIB] ponderthis0517-inf [MIPLIB] supportcase30 [MIPLIB] fhnw-binpack4-18 [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.643 57 / 1.311 74 / 1.413 186 / 1.806 575 / 2.218
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIPLIB top 5.
pythago7824 raw neos-4382714-ruvuma raw ponderthis0517-inf raw supportcase30 raw fhnw-binpack4-18 raw

Instance Summary

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

INSTANCE SUBMITTER DESCRIPTION ISS RANK
Parent Instance pythago7825 [MIPLIB] Felix J. L. Willamowski 2-coloring of Pythagorean triples 0.000000 -
MIC Top 5 pythago7824 [MIPLIB] Felix J. L. Willamowski 2-coloring of Pythagorean triples 0.643029 1
2club200v15p5scn [MIPLIB] Balabhaskar Balasundaram Maximum 2-club instance; graph; clique relaxations Solved with Gurobi 8.1 on 24 cores in approx. 23 hours. 0.706864 2
iis-hc-cov [MIPLIB] Marc Pfetsch 23 "middlehard" Set-Covering Instances for MIPLIB: they have a small number of variables compared to the number of constraints and CPLEX 12.1 needs about one hour to solve them.For more information, have a look into the readme file which explains how the instances can be created. 0.715910 3
eil33-2 [MIPLIB] J. Linderoth Set partitioning problem approximation for capicated vehicle routing problem instance from TSPLIB 0.722582 4
neos-5189128-totara [MIPLIB] Hans Mittelmann distribution of fruit 0.747081 5
MIPLIB Top 5 pythago7824 [MIPLIB] Felix J. L. Willamowski 2-coloring of Pythagorean triples 0.643029 1
neos-4382714-ruvuma [MIPLIB] Hans Mittelmann Collection of anonymous submissions to the NEOS Server for Optimization 1.311295 57
ponderthis0517-inf [MIPLIB] Rob Pratt Infeasible version of IBM Ponder This problem (with 52 characters and no spaces) from May 2017: https://www.research.ibm.com/haifa/ponderthis/challenges/May2017.html 1.413027 74
supportcase30 [MIPLIB] Domenico Salvagnin Instance coming from IBM developerWorks forum with unknown application. 1.805849 186
fhnw-binpack4-18 [MIPLIB] Simon Felix Feasability-only 3D bin packing with additional constraints 2.217616 575


pythago7825: Instance-to-Model Comparison Results

Model Group Assignment from MIPLIB: no model group assignment
Assigned Model Group Rank/ISS in the MIC: N.A. / N.A.

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: 2hopcds Model group: iis Model group: assign1 Model group: neos-pseudoapplication-106 Model group: f2gap
Name 2hopcds iis assign1 neos-pseudoapplication-106 f2gap
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.801 2 / 0.905 3 / 0.979 4 / 1.045 5 / 1.047

Model Group Summary

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

MODEL GROUP SUBMITTER DESCRIPTION ISS RANK
MIC Top 5 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. 0.801010 1
iis Marc Pfetsch 23 "middlehard" Set-Covering Models for MIPLIB: they have a small number of variables compared to the number of constraints and CPLEX 12.1 needs about one hour to solve them.For more information, have a look into the readme file which explains how the models can be created. 0.904560 2
assign1 Robert Fourer Imported from the MIPLIB2010 submissions. 0.979256 3
neos-pseudoapplication-106 Hans Mittelmann Collection of anonymous submissions to the NEOS Server for Optimization 1.044550 4
f2gap Salim Haddadi Restrictions of well-known hard generalized assignment problem models (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600) 1.047493 5