seymour1: Instance-to-Instance Comparison Results

Type: Instance
Submitter: MIPLIB submission pool
Description: Imported from the MIPLIB2010 submissions.
MIPLIB Entry

Parent Instance (seymour1)

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

seymour1 Raw seymour1 Decomposed seymour1 Composite of MIC top 5 seymour1 Composite of MIPLIB top 5 seymour1 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.
seymour decomposed f2gap401600 decomposed ta2-UUE decomposed neos5 decomposed neos-4382714-ruvuma decomposed
Name seymour [MIPLIB] f2gap401600 [MIPLIB] ta2-UUE [MIPLIB] neos5 [MIPLIB] neos-4382714-ruvuma [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.246 2 / 1.587 3 / 1.617 4 / 1.619 5 / 1.628
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIC top 5.
seymour raw f2gap401600 raw ta2-UUE raw neos5 raw neos-4382714-ruvuma 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.
seymour decomposed neos5 decomposed f2000 decomposed hanoi5 decomposed uct-subprob decomposed
Name seymour [MIPLIB] neos5 [MIPLIB] f2000 [MIPLIB] hanoi5 [MIPLIB] uct-subprob [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 / 1.246 4 / 1.619 47 / 1.867 394 / 2.216 868 / 2.422
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIPLIB top 5.
seymour raw neos5 raw f2000 raw hanoi5 raw uct-subprob raw

Instance Summary

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

INSTANCE SUBMITTER DESCRIPTION ISS RANK
Parent Instance seymour1 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 0.000000 -
MIC Top 5 seymour [MIPLIB] W. Cook, P. Seymour A set-covering problem that arose from work related to the proof of the 4-color theorem. 1.245523 1
f2gap401600 [MIPLIB] Salim Haddadi Restrictions of well-known hard generalized assignment problem instances (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600) 1.587275 2
ta2-UUE [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 1.617248 3
neos5 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. 1.619041 4
neos-4382714-ruvuma [MIPLIB] Hans Mittelmann Collection of anonymous submissions to the NEOS Server for Optimization 1.627779 5
MIPLIB Top 5 seymour [MIPLIB] W. Cook, P. Seymour A set-covering problem that arose from work related to the proof of the 4-color theorem. 1.245523 1
neos5 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. 1.619041 4
f2000 [MIPLIB] M. Winkler Reformulated SAT instance from the 2010 SAT conference pseudo-Boolean competition 1.867268 47
hanoi5 [MIPLIB] M. Winkler Reformulated SAT instance from the 2010 SAT conference pseudo-Boolean competition. Solved due to the 2012 pseudo-Boolean competition. 2.216466 394
uct-subprob [MIPLIB] Gerald Lach Subproblem of a university course timetabling problem. Switched to "easy" because it was solved by Gurobi 5.0 in 2106 seconds (May 2012). 2.422019 868


seymour1: 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: neos-pseudoapplication-21 Model group: generated Model group: independentset Model group: markshare Model group: scp
Name neos-pseudoapplication-21 generated independentset markshare scp
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.962 2 / 2.027 3 / 2.087 4 / 2.096 5 / 2.098

Model Group Summary

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

MODEL GROUP SUBMITTER DESCRIPTION ISS RANK
MIC Top 5 neos-pseudoapplication-21 NEOS Server Submission Imported from the MIPLIB2010 submissions. 1.961780 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. 2.026769 2
independentset Toni Sorrell These models are based on Neil Sloane's Challenge problems: Independent Sets in Graphs. 2.087472 3
markshare G. Cornuéjols, M. Dawande Market sharing problem 2.096376 4
scp Shunji Umetani This is a random test model generator for SCP using the scheme of the following paper, namely the column cost c[j] are integer randomly generated from [1,100]; every column covers at least one row; and every row is covered by at least two columns. see reference: E. Balas and A. Ho, Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study, Mathematical Programming, 12 (1980), 37-60. We have newly generated Classes I-N with the following parameter values, where each class has five models. We have also generated reduced models by a standard pricing method in the following paper: S. Umetani and M. Yagiura, Relaxation heuristics for the set covering problem, Journal of the Operations Research Society of Japan, 50 (2007), 350-375. You can obtain the model generator program from the following web site. https://sites.google.com/site/shunjiumetani/benchmark 2.098489 5