supportcase34: Instance-to-Instance Comparison Results

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

Parent Instance (supportcase34)

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

supportcase34 Raw supportcase34 Decomposed supportcase34 Composite of MIC top 5 supportcase34 Composite of MIPLIB top 5 supportcase34 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.
f2gap40400 decomposed gen-ip016 decomposed pb-market-split8-70-4 decomposed gen-ip002 decomposed gen-ip054 decomposed
Name f2gap40400 [MIPLIB] gen-ip016 [MIPLIB] pb-market-split8-70-4 [MIPLIB] gen-ip002 [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.382 2 / 1.409 3 / 1.410 4 / 1.421 5 / 1.438
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIC top 5.
f2gap40400 raw gen-ip016 raw pb-market-split8-70-4 raw gen-ip002 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.
triptim1 decomposed triptim4 decomposed triptim8 decomposed triptim2 decomposed triptim7 decomposed
Name triptim1 [MIPLIB] triptim4 [MIPLIB] triptim8 [MIPLIB] triptim2 [MIPLIB] triptim7* [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.
125 / 1.738 174 / 1.773 208 / 1.792 236 / 1.806 208* / 1.792*
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIPLIB top 5.
triptim1 raw triptim4 raw triptim8 raw triptim2 raw triptim7 raw

Instance Summary

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

INSTANCE SUBMITTER DESCRIPTION ISS RANK
Parent Instance supportcase34 [MIPLIB] Domenico Salvagnin Instance coming from IBM developerWorks forum with unknown application. 0.000000 -
MIC Top 5 f2gap40400 [MIPLIB] Salim Haddadi Restrictions of well-known hard generalized assignment problem instances (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600) 1.382197 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.409168 2
pb-market-split8-70-4 [MIPLIB] Gleb Belov These are the instances from MiniZinc Challenges 2012-2016 (see www.minizinc.org), compiled for MIP WITH INDICATOR CONSTRAINTS using the develop branch of MiniZinc and CPLEX 12.7.1 on 30 April 2017. Thus, these instances can only be handled by solvers accepting indicator constraints. For instances compiled with big-M/domain decomposition only, see my previous submission to MIPLIB.To recompile, create a directory MODELS, a list lst12_16.txt of the instances with full paths to mzn/dzn files of each instance per line, and say$> ~/install/libmzn/tests/benchmarking/mzn-test.py -l ../lst12_16.txt -slvPrf MZN-CPLEX -debug 1 -addOption "-timeout 3 -D fIndConstr=true -D fMIPdomains=false" -useJoinedName "-writeModel MODELS_IND/%s.mps" Alternatively, you can compile individual instance as follows: $> mzn-cplex -v -s -G linear -output-time ../challenge_2012_2016/mznc2016_probs/zephyrus/zephyrus.mzn ../challenge_2012_2016/mznc2016_p/zephyrus/14__8__6__3.dzn -a -timeout 3 -D fIndConstr=true -D fMIPdomains=false -writeModel MODELS_IND/challenge_2012_2016mznc2016_probszephyruszephyrusmzn-challenge_2012_2016mznc2016_probszephyrus14__8__6__3dzn.mps 1.410289 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.420623 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.438153 5
MIPLIB Top 5 triptim1 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 1.738217 125
triptim4 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 1.772541 174
triptim8 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 1.791772 208
triptim2 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 1.806093 236
triptim7* [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 1.791772* 208*


supportcase34: 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: scp Model group: stein Model group: markshare Model group: generated
Name neos-pseudoapplication-21 scp stein markshare generated
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.815 2 / 1.872 3 / 1.949 4 / 1.952 5 / 2.011

Model Group Summary

The table below contains summary information for the five most similar model groups to supportcase34 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.815166 1
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.872136 2
stein MIPLIB submission pool Imported from the MIPLIB2010 submissions. 1.948975 3
markshare G. Cornuéjols, M. Dawande Market sharing problem 1.951727 4
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. 2.010903 5


* triptim7 is a duplicate of triptim8.