neos-1605061: Instance-to-Instance Comparison Results

Type: Instance
Submitter: NEOS Server Submission
Description: Instance coming from the NEOS Server with unknown application
MIPLIB Entry

Parent Instance (neos-1605061)

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

neos-1605061 Raw neos-1605061 Decomposed neos-1605061 Composite of MIC top 5 neos-1605061 Composite of MIPLIB top 5 neos-1605061 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.
neos-885524 decomposed f2gap801600 decomposed mod010 decomposed pythago7825 decomposed pythago7824 decomposed
Name neos-885524 [MIPLIB] f2gap801600 [MIPLIB] mod010 [MIPLIB] pythago7825 [MIPLIB] pythago7824 [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 / 1.189 2 / 1.209 3 / 1.214 4 / 1.216 5 / 1.231
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIC top 5.
neos-885524 raw f2gap801600 raw mod010 raw pythago7825 raw pythago7824 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.
neos-1601936 decomposed csched007 decomposed neos-691058 decomposed csched008 decomposed neos-503737 decomposed
Name neos-1601936 [MIPLIB] csched007 [MIPLIB] neos-691058 [MIPLIB] csched008 [MIPLIB] neos-503737 [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.
20 / 1.366 123 / 1.805 144 / 1.863 150 / 1.870 203 / 2.002
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIPLIB top 5.
neos-1601936 raw csched007 raw neos-691058 raw csched008 raw neos-503737 raw

Instance Summary

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

INSTANCE SUBMITTER DESCRIPTION ISS RANK
Parent Instance neos-1605061 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application 0.000000 -
MIC Top 5 neos-885524 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application 1.189452 1
f2gap801600 [MIPLIB] Salim Haddadi Restrictions of well-known hard generalized assignment problem instances (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600) 1.209301 2
mod010 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 1.214066 3
pythago7825 [MIPLIB] Felix J. L. Willamowski 2-coloring of Pythagorean triples 1.215530 4
pythago7824 [MIPLIB] Felix J. L. Willamowski 2-coloring of Pythagorean triples 1.230808 5
MIPLIB Top 5 neos-1601936 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application 1.366278 20
csched007 [MIPLIB] Tallys Yunes Cumulative scheduling problem instance 1.805174 123
neos-691058 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. 1.862648 144
csched008 [MIPLIB] Tallys Yunes Cumulative scheduling problem instance 1.869608 150
neos-503737 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. 2.002475 203


neos-1605061: Instance-to-Model Comparison Results

Model Group Assignment from MIPLIB: neos-pseudoapplication-5
Assigned Model Group Rank/ISS in the MIC: 66 / 2.411

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: independentset Model group: generated Model group: f2gap Model group: assign1 Model group: 2hopcds
Name independentset generated f2gap assign1 2hopcds
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.421 2 / 1.480 3 / 1.543 4 / 1.546 5 / 1.630

Model Group Summary

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

MODEL GROUP SUBMITTER DESCRIPTION ISS RANK
MIC Top 5 independentset Toni Sorrell These models are based on Neil Sloane's Challenge problems: Independent Sets in Graphs. 1.421047 1
generated Simon Bowly Randomly generated integer and binary programming models. These results are part of an early phase of work aimed at generating diverse and challenging MIP models for experimental testing. We have aimed to produce small integer and binary programming models which are reasonably difficult to solve and have varied structure, eliciting a range of behaviour in state of the art algorithms. 1.480008 2
f2gap Salim Haddadi Restrictions of well-known hard generalized assignment problem models (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600) 1.543315 3
assign1 Robert Fourer Imported from the MIPLIB2010 submissions. 1.546216 4
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.629724 5