s82: Instance-to-Instance Comparison Results

Type: Instance
Submitter: Daniel Espinoza
Description: Wine Scheduling problem with 82 jobs and four processing machines
MIPLIB Entry

Parent Instance (s82)

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

s82 Raw s82 Decomposed s82 Composite of MIC top 5 s82 Composite of MIPLIB top 5 s82 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.
s55 decomposed f2gap40400 decomposed neos-4358725-tagus decomposed ns1116954 decomposed gen-ip054 decomposed
Name s55 [MIPLIB] f2gap40400 [MIPLIB] neos-4358725-tagus [MIPLIB] ns1116954 [MIPLIB] gen-ip054 [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.477 2 / 1.503 3 / 1.543 4 / 1.566 5 / 1.577
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIC top 5.
s55 raw f2gap40400 raw neos-4358725-tagus raw ns1116954 raw gen-ip054 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.
s55 decomposed neos-4531126-vouga decomposed s100 decomposed s250r10 decomposed supportcase6 decomposed
Name s55 [MIPLIB] neos-4531126-vouga [MIPLIB] s100 [MIPLIB] s250r10 [MIPLIB] supportcase6 [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.477 326 / 1.968 447 / 1.996 757 / 2.148 965 / 2.852
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIPLIB top 5.
s55 raw neos-4531126-vouga raw s100 raw s250r10 raw supportcase6 raw

Instance Summary

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

INSTANCE SUBMITTER DESCRIPTION ISS RANK
Parent Instance s82 [MIPLIB] Daniel Espinoza Wine Scheduling problem with 82 jobs and four processing machines 0.000000 -
MIC Top 5 s55 [MIPLIB] Daniel Espinoza Wine Scheduling problem with 55 jobs and four processing machines 1.476901 1
f2gap40400 [MIPLIB] Salim Haddadi Restrictions of well-known hard generalized assignment problem instances (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600) 1.503143 2
neos-4358725-tagus [MIPLIB] Jeff Linderoth (None provided) 1.543210 3
ns1116954 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application 1.566009 4
gen-ip054 [MIPLIB] Simon Bowly Randomly generated integer and binary programming instances. These results are part of an early phase of work aimed at generating diverse and challenging MIP instances for experimental testing. We have aimed to produce small integer and binary programming instances which are reasonably difficult to solve and have varied structure, eliciting a range of behaviour in state of the art algorithms. 1.577380 5
MIPLIB Top 5 s55 [MIPLIB] Daniel Espinoza Wine Scheduling problem with 55 jobs and four processing machines 1.476901 1
neos-4531126-vouga [MIPLIB] Jeff Linderoth (None provided) 1.967577 326
s100 [MIPLIB] Daniel Espinoza Wine Scheduling problem with 100 jobs and four processing machines 1.995739 447
s250r10 [MIPLIB] Daniel Espinoza Wine Scheduling problem with 250 jobs (up to 10 alternatives for processing) and four processing machines 2.148069 757
supportcase6 [MIPLIB] Michael Winkler MIP instances collected from Gurobi forum with unknown application 2.852063 965


s82: Instance-to-Model Comparison Results

Model Group Assignment from MIPLIB: Spinoza
Assigned Model Group Rank/ISS in the MIC: 25 / 2.288

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: scp Model group: markshare Model group: enlight Model group: neos-pseudoapplication-21 Model group: stein
Name scp markshare enlight neos-pseudoapplication-21 stein
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.864 2 / 1.892 3 / 1.907 4 / 1.962 5 / 1.996

Model Group Summary

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

MODEL GROUP SUBMITTER DESCRIPTION ISS RANK
MIC Top 5 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 1.863664 1
markshare G. Cornuéjols, M. Dawande Market sharing problem 1.892165 2
enlight A. Zymolka Model to solve model of a combinatorial game ``EnLight'' Imported from the MIPLIB2010 submissions. 1.906677 3
neos-pseudoapplication-21 NEOS Server Submission Imported from the MIPLIB2010 submissions. 1.962173 4
stein MIPLIB submission pool Imported from the MIPLIB2010 submissions. 1.995932 5