f2000: Instance-to-Instance Comparison Results

Type: Instance
Submitter: M. Winkler
Description: Reformulated SAT instance from the 2010 SAT conference pseudo-Boolean competition
MIPLIB Entry

Parent Instance (f2000)

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

f2000 Raw f2000 Decomposed f2000 Composite of MIC top 5 f2000 Composite of MIPLIB top 5 f2000 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.
pythago7825 decomposed pythago7824 decomposed f2gap801600 decomposed mod010 decomposed iis-hc-cov decomposed
Name pythago7825 [MIPLIB] pythago7824 [MIPLIB] f2gap801600 [MIPLIB] mod010 [MIPLIB] iis-hc-cov [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.880 2 / 0.893 3 / 0.915 4 / 0.936 5 / 0.938
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIC top 5.
pythago7825 raw pythago7824 raw f2gap801600 raw mod010 raw iis-hc-cov 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.
stein45inf decomposed seymour decomposed hanoi5 decomposed stein15inf decomposed stein9inf decomposed
Name stein45inf [MIPLIB] seymour [MIPLIB] hanoi5 [MIPLIB] stein15inf [MIPLIB] stein9inf [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.
157 / 1.689 171 / 1.720 407 / 2.006 667 / 2.166 942 / 2.324
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIPLIB top 5.
stein45inf raw seymour raw hanoi5 raw stein15inf raw stein9inf raw

Instance Summary

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

INSTANCE SUBMITTER DESCRIPTION ISS RANK
Parent Instance f2000 [MIPLIB] M. Winkler Reformulated SAT instance from the 2010 SAT conference pseudo-Boolean competition 0.000000 -
MIC Top 5 pythago7825 [MIPLIB] Felix J. L. Willamowski 2-coloring of Pythagorean triples 0.879513 1
pythago7824 [MIPLIB] Felix J. L. Willamowski 2-coloring of Pythagorean triples 0.893018 2
f2gap801600 [MIPLIB] Salim Haddadi Restrictions of well-known hard generalized assignment problem instances (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600) 0.914677 3
mod010 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 0.935602 4
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.938458 5
MIPLIB Top 5 stein45inf [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 1.689289 157
seymour [MIPLIB] W. Cook, P. Seymour A set-covering problem that arose from work related to the proof of the 4-color theorem. 1.720385 171
hanoi5 [MIPLIB] M. Winkler Reformulated SAT instance from the 2010 SAT conference pseudo-Boolean competition. Solved due to the 2012 pseudo-Boolean competition. 2.005880 407
stein15inf [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 2.166470 667
stein9inf [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 2.324028 942


f2000: 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: assign1 Model group: neos-pseudoapplication-48 Model group: iis Model group: 2hopcds Model group: neos-pseudoapplication-52
Name assign1 neos-pseudoapplication-48 iis 2hopcds neos-pseudoapplication-52
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.360 2 / 1.398 3 / 1.448 4 / 1.463 5 / 1.475

Model Group Summary

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

MODEL GROUP SUBMITTER DESCRIPTION ISS RANK
MIC Top 5 assign1 Robert Fourer Imported from the MIPLIB2010 submissions. 1.359890 1
neos-pseudoapplication-48 NEOS Server Submission Imported from the MIPLIB2010 submissions. 1.397735 2
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. 1.448409 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.463111 4
neos-pseudoapplication-52 Jeff Linderoth (None provided) 1.475024 5