supportcase37: Instance-to-Instance Comparison Results

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

Parent Instance (supportcase37)

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

supportcase37 Raw supportcase37 Decomposed supportcase37 Composite of MIC top 5 supportcase37 Composite of MIPLIB top 5 supportcase37 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.
neos-4647032-veleka decomposed fjspeasy01i decomposed supportcase14 decomposed scpm1 decomposed gen-ip016 decomposed
Name neos-4647032-veleka [MIPLIB] fjspeasy01i [MIPLIB] supportcase14 [MIPLIB] scpm1 [MIPLIB] gen-ip016 [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.334 2 / 1.371 3 / 1.378 4 / 1.430 5 / 1.437
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIC top 5.
neos-4647032-veleka raw fjspeasy01i raw supportcase14 raw scpm1 raw gen-ip016 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.
qiu decomposed neos-3209462-rhin decomposed neos-873061 decomposed neos-3755335-nizao decomposed neos-3759587-noosa decomposed
Name qiu [MIPLIB] neos-3209462-rhin [MIPLIB] neos-873061 [MIPLIB] neos-3755335-nizao [MIPLIB] neos-3759587-noosa [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.511 82 / 1.622 424 / 1.805 626 / 1.916 666 / 1.955
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIPLIB top 5.
qiu raw neos-3209462-rhin raw neos-873061 raw neos-3755335-nizao raw neos-3759587-noosa raw

Instance Summary

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

INSTANCE SUBMITTER DESCRIPTION ISS RANK
Parent Instance supportcase37 [MIPLIB] Domenico Salvagnin Instance coming from IBM developerWorks forum with unknown application. 0.000000 -
MIC Top 5 neos-4647032-veleka [MIPLIB] Hans Mittelmann Collection of anonymous submissions to the NEOS Server for Optimization 1.334006 1
fjspeasy01i [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.370614 2
supportcase14 [MIPLIB] Michael Winkler MIP instances collected from Gurobi forum with unknown application 1.377739 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.430343 4
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.437105 5
MIPLIB Top 5 qiu [MIPLIB] Y. Chiu, J. Eckstein Fiber-optic network design, logical SONET ring level 1.510663 19
neos-3209462-rhin [MIPLIB] Jeff Linderoth (None provided) 1.621581 82
neos-873061 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. 1.804820 424
neos-3755335-nizao [MIPLIB] Jeff Linderoth (None provided) 1.916236 626
neos-3759587-noosa [MIPLIB] Jeff Linderoth (None provided) 1.955079 666


supportcase37: 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: markshare Model group: scp Model group: ustun Model group: fjsp Model group: stein
Name markshare scp ustun fjsp stein
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.739 2 / 1.791 3 / 1.844 4 / 1.869 5 / 1.882

Model Group Summary

The table below contains summary information for the five most similar model groups to supportcase37 according to the MIC.

MODEL GROUP SUBMITTER DESCRIPTION ISS RANK
MIC Top 5 markshare G. Cornuéjols, M. Dawande Market sharing problem 1.738744 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.790675 2
ustun Berk Ustun MIP to create optimized data-driven scoring systems. See: https://github.com/ustunb/miplib2017-slim#miplib2017-slim for a description. 1.843719 3
fjsp Gleb Belov These are the models 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 models can only be handled by solvers accepting indicator constraints. For models 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 models with full paths to mzn/dzn files of each model 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 model 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.868690 4
stein MIPLIB submission pool Imported from the MIPLIB2010 submissions. 1.881750 5