manna81: Instance-to-Instance Comparison Results

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

Parent Instance (manna81)

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

manna81 Raw manna81 Decomposed manna81 Composite of MIC top 5 manna81 Composite of MIPLIB top 5 manna81 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.
osorio-cta decomposed ger50-17-ptp-pop-6t decomposed gen-ip021 decomposed ponderthis0517-inf decomposed gen-ip016 decomposed
Name osorio-cta [MIPLIB] ger50-17-ptp-pop-6t [MIPLIB] gen-ip021 [MIPLIB] ponderthis0517-inf [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.208 2 / 1.274 3 / 1.289 4 / 1.292 5 / 1.302
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIC top 5.
osorio-cta raw ger50-17-ptp-pop-6t raw gen-ip021 raw ponderthis0517-inf 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.
sorrell8 decomposed sorrell4 decomposed z26 decomposed sorrell7 decomposed sorrell3 decomposed
Name sorrell8 [MIPLIB] sorrell4 [MIPLIB] z26 [MIPLIB] sorrell7 [MIPLIB] sorrell3 [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.
900 / 2.188 929 / 2.309 965 / 2.718 985 / 3.335 991 / 3.689
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIPLIB top 5.
sorrell8 raw sorrell4 raw z26 raw sorrell7 raw sorrell3 raw

Instance Summary

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

INSTANCE SUBMITTER DESCRIPTION ISS RANK
Parent Instance manna81 [MIPLIB] MIPLIB submission pool Imported from the MIPLIB2010 submissions. 0.000000 -
MIC Top 5 osorio-cta [MIPLIB] Jordi Castro Set of MILP instances of the CTA (Controlled Tabular Adjustment) problem, a method to protect statistical tabular data, belonging to the field of SDC (Statistical Disclosure Control). Raw data of instances are real or pseudo-real, provided by several National Statistical Agencies. We generated the CTA problem for these data. 1.208062 1
ger50-17-ptp-pop-6t [MIPLIB] C. Raack Multi-layer network design problem using a link-flow formulation over a path-flow formulation. 1.273915 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.289258 3
ponderthis0517-inf [MIPLIB] Rob Pratt Infeasible version of IBM Ponder This problem (with 52 characters and no spaces) from May 2017: https://www.research.ibm.com/haifa/ponderthis/challenges/May2017.html 1.292336 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.302170 5
MIPLIB Top 5 sorrell8 [MIPLIB] Toni Sorrell These instances are based on Neil Sloane's Challenge problems: Independent Sets in Graphs. 2.188456 900
sorrell4 [MIPLIB] Toni Sorrell These instances are based on Neil Sloane's Challenge problems: Independent Sets in Graphs. 2.308858 929
z26 [MIPLIB] Daniel Bienstock Set packing problem arising from the ongoing "Frequency Spectrum Auction" in the U.S. Work is collaboration with Ion Media Networks, Inc. 2.717588 965
sorrell7 [MIPLIB] Toni Sorrell These instances are based on Neil Sloane's Challenge problems: Independent Sets in Graphs. 3.334563 985
sorrell3 [MIPLIB] Toni Sorrell These instances are based on Neil Sloane's Challenge problems: Independent Sets in Graphs. 3.689302 991


manna81: 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: timtab Model group: neos-pseudoapplication-108 Model group: generated
Name scp neos-pseudoapplication-21 timtab neos-pseudoapplication-108 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.629 2 / 1.705 3 / 1.749 4 / 1.822 5 / 1.854

Model Group Summary

The table below contains summary information for the five most similar model groups to manna81 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.628768 1
neos-pseudoapplication-21 NEOS Server Submission Imported from the MIPLIB2010 submissions. 1.705381 2
timtab C. Liebchen, R. Möhring Public transport scheduling problem 1.749090 3
neos-pseudoapplication-108 NEOS Server Submission Model coming from the NEOS Server with unknown application 1.821679 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. 1.854346 5