supportcase30: Instance-to-Instance Comparison Results

Type: Instance
Submitter: Domenico Salvagnin
Description: Instance coming from IBM developerWorks forum with unknown application.
MIPLIB Entry

Parent Instance (supportcase30)

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

supportcase30 Raw supportcase30 Decomposed supportcase30 Composite of MIC top 5 supportcase30 Composite of MIPLIB top 5 supportcase30 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.
gen-ip021 decomposed gen-ip016 decomposed gen-ip036 decomposed gen-ip002 decomposed scpm1 decomposed
Name gen-ip021 [MIPLIB] gen-ip016 [MIPLIB] gen-ip036 [MIPLIB] gen-ip002 [MIPLIB] scpm1 [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.403 2 / 1.406 3 / 1.407 4 / 1.410 5 / 1.426
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIC top 5.
gen-ip021 raw gen-ip016 raw gen-ip036 raw gen-ip002 raw scpm1 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 stein15inf decomposed pythago7825 decomposed pythago7824 decomposed stein9inf decomposed
Name stein45inf [MIPLIB] stein15inf [MIPLIB] pythago7825 [MIPLIB] pythago7824 [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.
19 / 1.557 89 / 1.757 127 / 1.806 159 / 1.828 170 / 1.832
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIPLIB top 5.
stein45inf raw stein15inf raw pythago7825 raw pythago7824 raw stein9inf raw

Instance Summary

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

INSTANCE SUBMITTER DESCRIPTION ISS RANK
Parent Instance supportcase30 [MIPLIB] Domenico Salvagnin Instance coming from IBM developerWorks forum with unknown application. 0.000000 -
MIC Top 5 gen-ip021 [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.402550 1
gen-ip016 [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. Solved with XPRESS in a few seconds. 1.406429 2
gen-ip036 [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.406756 3
gen-ip002 [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.409551 4
scpm1 [MIPLIB] Shunji Umetani This is a random test instance 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 instances. We have also generated reduced instances 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 instance generator program from the following web site. https://sites.google.com/site/shunjiumetani/benchmark 1.425954 5
MIPLIB Top 5 stein45inf [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 1.556955 19
stein15inf [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 1.756808 89
pythago7825 [MIPLIB] Felix J. L. Willamowski 2-coloring of Pythagorean triples 1.805849 127
pythago7824 [MIPLIB] Felix J. L. Willamowski 2-coloring of Pythagorean triples 1.828420 159
stein9inf [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 1.832465 170


supportcase30: 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: scp Model group: independentset Model group: markshare
Name neos-pseudoapplication-21 generated scp independentset markshare
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.871 2 / 1.950 3 / 1.966 4 / 1.982 5 / 2.072

Model Group Summary

The table below contains summary information for the five most similar model groups to supportcase30 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.870774 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.949843 2
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.966307 3
independentset Toni Sorrell These models are based on Neil Sloane's Challenge problems: Independent Sets in Graphs. 1.981914 4
markshare G. Cornuéjols, M. Dawande Market sharing problem 2.071809 5