supportcase21i: Instance-to-Instance Comparison Results

Type: Instance
Submitter: Michael Winkler
Description: MIP with Indicator instances collected from Gurobi forum with unknown application
MIPLIB Entry

Parent Instance (supportcase21i)

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

supportcase21i Raw supportcase21i Decomposed supportcase21i Composite of MIC top 5 supportcase21i Composite of MIPLIB top 5 supportcase21i 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-ip021 decomposed gen-ip002 decomposed scpm1 decomposed gen-ip054 decomposed
Name gen-ip016 [MIPLIB] gen-ip021 [MIPLIB] gen-ip002 [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 / 0.781 2 / 0.842 3 / 0.846 4 / 0.894 5 / 0.912
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-ip021 raw gen-ip002 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.
supportcase22 decomposed supportcase2 decomposed tw-myciel4 decomposed supportcase10 decomposed neos-3402454-bohle decomposed
Name supportcase22 [MIPLIB] supportcase2 [MIPLIB] tw-myciel4 [MIPLIB] supportcase10 [MIPLIB] supportcase22** [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.
453 / 1.509 470 / 1.519 759 / 1.719 954 / 2.447 N.A.** / N.A.**
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIPLIB top 5.
supportcase22 raw supportcase2 raw tw-myciel4 raw supportcase10 raw neos-3402454-bohle raw

Instance Summary

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

INSTANCE SUBMITTER DESCRIPTION ISS RANK
Parent Instance supportcase21i [MIPLIB] Michael Winkler MIP with Indicator instances collected from Gurobi forum with unknown application 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. 0.781162 1
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. 0.842482 2
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. 0.845749 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 0.894345 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. 0.911876 5
MIPLIB Top 5 supportcase22 [MIPLIB] Michael Winkler MIP instances collected from Gurobi forum with unknown application 1.508934 453
supportcase2 [MIPLIB] Michael Winkler MIP instances collected from Gurobi forum with unknown application 1.518802 470
tw-myciel4 [MIPLIB] Arie Koster Model to compute the treewidth of the Mycielski-4 instance from the DIMACS graph coloring database. Solved in June 2013 by CPLEX 12.5.1 (12 threads) in about 66 hours. The solving was performed in two steps: first solving with 50 GB tree memory limit (took 11307.42 seconds), after that, setting the tree memory limit to 80 GB and switching to depth first search (took 226152.14 seconds). 1.718629 759
supportcase10 [MIPLIB] Michael Winkler MIP instances collected from Gurobi forum with unknown application 2.446600 954
supportcase22** [MIPLIB] Jeff Linderoth (None provided) N.A.** N.A.**


supportcase21i: 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: scp Model group: neos-pseudoapplication-21 Model group: markshare Model group: stein Model group: enlight
Name scp neos-pseudoapplication-21 markshare 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.035 2 / 1.169 3 / 1.216 4 / 1.274 5 / 1.429

Model Group Summary

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


** neos-3402454-bohle could not be decomposed by GCG, and was not included in our dataset.

Updated August 16, 2019