neos-2987202-jeir: Instance-to-Instance Comparison Results

Type: Instance
Submitter: Jeff Linderoth
Description: (None provided)
MIPLIB Entry

Parent Instance (neos-2987202-jeir)

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

neos-2987202-jeir Raw neos-2987202-jeir Decomposed neos-2987202-jeir Composite of MIC top 5 neos-2987202-jeir Composite of MIPLIB top 5 neos-2987202-jeir 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.
scpm1 decomposed markshare2 decomposed markshare1 decomposed gen-ip002 decomposed gen-ip016 decomposed
Name scpm1 [MIPLIB] markshare2 [MIPLIB] markshare1 [MIPLIB] gen-ip002 [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.143 2 / 1.170 3 / 1.191 4 / 1.204 5 / 1.205
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIC top 5.
scpm1 raw markshare2 raw markshare1 raw gen-ip002 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.
neos-2987310-joes decomposed dws012-01 decomposed dws012-03 decomposed dws012-02 decomposed splan1 decomposed
Name neos-2987310-joes [MIPLIB] dws012-01 [MIPLIB] dws012-03 [MIPLIB] dws012-02 [MIPLIB] neos-2987310-joes** [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.
46 / 1.336 138 / 1.433 150 / 1.438 166 / 1.446 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.
neos-2987310-joes raw dws012-01 raw dws012-03 raw dws012-02 raw splan1 raw

Instance Summary

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

INSTANCE SUBMITTER DESCRIPTION ISS RANK
Parent Instance neos-2987202-jeir [MIPLIB] Jeff Linderoth (None provided) 0.000000 -
MIC Top 5 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.143118 1
markshare2 [MIPLIB] G. Cornuéjols, M. Dawande Market sharing problem 1.170304 2
markshare1 [MIPLIB] G. Cornuéjols, M. Dawande Market sharing problem 1.190684 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.203597 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.204915 5
MIPLIB Top 5 neos-2987310-joes [MIPLIB] Jeff Linderoth (None provided) 1.335840 46
dws012-01 [MIPLIB] Philipp Leise MILP for designing a decentralized water supply system for drinking water in skyscrapers. The nonlinear characteristics of pumps are integrated with the help of an aggregated convex combination. The instances vary in the total number of floors and load scenarios for water demand. First stage variables represent the layout decisions, second stage variables represent the operational parameters, such as the continuous rotating speed of pumps or binary switching decisions. 1.433424 138
dws012-03 [MIPLIB] Philipp Leise MILP for designing a decentralized water supply system for drinking water in skyscrapers. The nonlinear characteristics of pumps are integrated with the help of an aggregated convex combination. The instances vary in the total number of floors and load scenarios for water demand. First stage variables represent the layout decisions, second stage variables represent the operational parameters, such as the continuous rotating speed of pumps or binary switching decisions. 1.438188 150
dws012-02 [MIPLIB] Philipp Leise MILP for designing a decentralized water supply system for drinking water in skyscrapers. The nonlinear characteristics of pumps are integrated with the help of an aggregated convex combination. The instances vary in the total number of floors and load scenarios for water demand. First stage variables represent the layout decisions, second stage variables represent the operational parameters, such as the continuous rotating speed of pumps or binary switching decisions. 1.446124 166
neos-2987310-joes** [MIPLIB] C. Helmberg, A. Lau University course timetabling instance N.A.** N.A.**


neos-2987202-jeir: Instance-to-Model Comparison Results

Model Group Assignment from MIPLIB: neos-pseudoapplication-82
Assigned Model Group Rank/ISS in the MIC: 150 / 2.920

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: stein Model group: markshare Model group: neos-pseudoapplication-21 Model group: enlight
Name scp stein markshare neos-pseudoapplication-21 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.548 2 / 1.672 3 / 1.692 4 / 1.731 5 / 1.804

Model Group Summary

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


** splan1 could not be decomposed by GCG, and was not included in our dataset.