f2gap40400: Instance-to-Instance Comparison Results

Type: Instance
Submitter: Salim Haddadi
Description: Restrictions of well-known hard generalized assignment problem instances (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600)
MIPLIB Entry

Parent Instance (f2gap40400)

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

f2gap40400 Raw f2gap40400 Decomposed f2gap40400 Composite of MIC top 5 f2gap40400 Composite of MIPLIB top 5 f2gap40400 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-ip054 decomposed gen-ip002 decomposed scpm1 decomposed gen-ip016 decomposed gen-ip021 decomposed
Name gen-ip054 [MIPLIB] gen-ip002 [MIPLIB] scpm1 [MIPLIB] gen-ip016 [MIPLIB] gen-ip021 [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.682 2 / 0.686 3 / 0.693 4 / 0.743 5 / 0.752
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIC top 5.
gen-ip054 raw gen-ip002 raw scpm1 raw gen-ip016 raw gen-ip021 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.
f2gap201600 decomposed f2gap401600 decomposed f2gap801600 decomposed ic97_potential decomposed icir97_potential decomposed
Name f2gap201600 [MIPLIB] f2gap401600 [MIPLIB] f2gap801600 [MIPLIB] ic97_potential [MIPLIB] icir97_potential [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.
13 / 0.927 30 / 1.019 211 / 1.213 344 / 1.253 655 / 1.429
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIPLIB top 5.
f2gap201600 raw f2gap401600 raw f2gap801600 raw ic97_potential raw icir97_potential raw

Instance Summary

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

INSTANCE SUBMITTER DESCRIPTION ISS RANK
Parent Instance f2gap40400 [MIPLIB] Salim Haddadi Restrictions of well-known hard generalized assignment problem instances (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600) 0.000000 -
MIC Top 5 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.682031 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. 0.686350 2
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.693241 3
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.742821 4
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.751946 5
MIPLIB Top 5 f2gap201600 [MIPLIB] Salim Haddadi Restrictions of well-known hard generalized assignment problem instances (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600) 0.926989 13
f2gap401600 [MIPLIB] Salim Haddadi Restrictions of well-known hard generalized assignment problem instances (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600) 1.018849 30
f2gap801600 [MIPLIB] Salim Haddadi Restrictions of well-known hard generalized assignment problem instances (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600) 1.212563 211
ic97_potential [MIPLIB] L. Peeters A model for cyclic railway timetable optimization 1.252960 344
icir97_potential [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 1.429446 655


f2gap40400: Instance-to-Model Comparison Results

Model Group Assignment from MIPLIB: f2gap
Assigned Model Group Rank/ISS in the MIC: 95 / 2.062

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: stein Model group: neos-pseudoapplication-74 Model group: enlight
Name scp markshare stein neos-pseudoapplication-74 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 / 0.844 2 / 1.023 3 / 1.093 4 / 1.105 5 / 1.137

Model Group Summary

The table below contains summary information for the five most similar model groups to f2gap40400 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 0.844073 1
markshare G. Cornuéjols, M. Dawande Market sharing problem 1.022990 2
stein MIPLIB submission pool Imported from the MIPLIB2010 submissions. 1.092623 3
neos-pseudoapplication-74 Jeff Linderoth (None provided) 1.104854 4
enlight A. Zymolka Model to solve model of a combinatorial game ``EnLight'' Imported from the MIPLIB2010 submissions. 1.137327 5