mod011: Instance-to-Instance Comparison Results

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

Parent Instance (mod011)

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

mod011 Raw mod011 Decomposed mod011 Composite of MIC top 5 mod011 Composite of MIPLIB top 5 mod011 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-ip016 decomposed gen-ip002 decomposed gen-ip021 decomposed scpm1 decomposed gen-ip054 decomposed
Name gen-ip016 [MIPLIB] gen-ip002 [MIPLIB] gen-ip021 [MIPLIB] scpm1 [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.312 2 / 1.329 3 / 1.356 4 / 1.357 5 / 1.372
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIC top 5.
gen-ip016 raw gen-ip002 raw gen-ip021 raw scpm1 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.
b2c1s1 decomposed cost266-UUE decomposed a2c1s1 decomposed a1c1s1 decomposed b1c1s1 decomposed
Name b2c1s1 [MIPLIB] cost266-UUE [MIPLIB] a2c1s1 [MIPLIB] a1c1s1 [MIPLIB] b1c1s1* [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.
421 / 1.806 550 / 1.861 560 / 1.868 583 / 1.880 421* / 1.806*
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIPLIB top 5.
b2c1s1 raw cost266-UUE raw a2c1s1 raw a1c1s1 raw b1c1s1 raw

Instance Summary

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

INSTANCE SUBMITTER DESCRIPTION ISS RANK
Parent Instance mod011 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 0.000000 -
MIC Top 5 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.311999 1
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.328905 2
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.356420 3
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.356730 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.372158 5
MIPLIB Top 5 b2c1s1 [MIPLIB] M. Vyve, Y. Pochet Lot sizing instance. Solved by Gurobi 4.6.1 (12 threads) in 116575 seconds (January 2012). 1.806455 421
cost266-UUE [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 1.861231 550
a2c1s1 [MIPLIB] M. Vyve, Y. Pochet Lot sizing instance. 1.867772 560
a1c1s1 [MIPLIB] M. Vyve, Y. Pochet Lot sizing instance. Alkis Vazacopoulos reports solving this instance using XPRESS 2006B. 1.879981 583
b1c1s1* [MIPLIB] M. Vyve, Y. Pochet Lot sizing instance. 1.806455* 421*


mod011: Instance-to-Model Comparison Results

Model Group Assignment from MIPLIB: mod
Assigned Model Group Rank/ISS in the MIC: 41 / 2.246

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: neos-pseudoapplication-21 Model group: stein Model group: enlight
Name scp markshare neos-pseudoapplication-21 stein enlight
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.633 2 / 1.735 3 / 1.769 4 / 1.823 5 / 1.865

Model Group Summary

The table below contains summary information for the five most similar model groups to mod011 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.632789 1
markshare G. Cornuéjols, M. Dawande Market sharing problem 1.735430 2
neos-pseudoapplication-21 NEOS Server Submission Imported from the MIPLIB2010 submissions. 1.769142 3
stein MIPLIB submission pool Imported from the MIPLIB2010 submissions. 1.822901 4
enlight A. Zymolka Model to solve model of a combinatorial game ``EnLight'' Imported from the MIPLIB2010 submissions. 1.865287 5


* b1c1s1 is a duplicate of b2c1s1.