neos-2987310-joes: Instance-to-Instance Comparison Results

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

Parent Instance (neos-2987310-joes)

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

neos-2987310-joes Raw neos-2987310-joes Decomposed neos-2987310-joes Composite of MIC top 5 neos-2987310-joes Composite of MIPLIB top 5 neos-2987310-joes 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.
moj-mining decomposed neos-3025225-shelon decomposed ns1828997 decomposed scpm1 decomposed neos-1367061 decomposed
Name moj-mining [MIPLIB] neos-3025225-shelon [MIPLIB] ns1828997 [MIPLIB] scpm1 [MIPLIB] neos-1367061 [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.708 2 / 1.074 3 / 1.241 4 / 1.253 5 / 1.263
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIC top 5.
moj-mining raw neos-3025225-shelon raw ns1828997 raw scpm1 raw neos-1367061 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-2987202-jeir decomposed dws012-01 decomposed dws012-03 decomposed dws012-02 decomposed dws008-01 decomposed
Name neos-2987202-jeir [MIPLIB] dws012-01 [MIPLIB] dws012-03 [MIPLIB] dws012-02 [MIPLIB] dws008-01 [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.
14 / 1.336 249 / 1.608 279 / 1.622 280 / 1.622 377 / 1.663
Raw These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIPLIB top 5.
neos-2987202-jeir raw dws012-01 raw dws012-03 raw dws012-02 raw dws008-01 raw

Instance Summary

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

INSTANCE SUBMITTER DESCRIPTION ISS RANK
Parent Instance neos-2987310-joes [MIPLIB] Jeff Linderoth (None provided) 0.000000 -
MIC Top 5 moj-mining [MIPLIB] Alexandra M. Newman open pit mine production scheduling problem with inventory 0.707658 1
neos-3025225-shelon [MIPLIB] Hans Mittelmann Collection of anonymous submissions to the NEOS Server for Optimization 1.073535 2
ns1828997 [MIPLIB] NEOS Server Submission Instance coming from the NEOS Server with unknown application. 1.240601 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.252597 4
neos-1367061 [MIPLIB] NEOS Server Submission Imported from the MIPLIB2010 submissions. 1.262996 5
MIPLIB Top 5 neos-2987202-jeir [MIPLIB] Jeff Linderoth (None provided) 1.335840 14
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.607537 249
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.621646 279
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.621729 280
dws008-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.663237 377


neos-2987310-joes: Instance-to-Model Comparison Results

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

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: neos-pseudoapplication-21 Model group: markshare Model group: neos-pseudoapplication-74
Name scp stein neos-pseudoapplication-21 markshare neos-pseudoapplication-74
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.593 2 / 1.727 3 / 1.800 4 / 1.801 5 / 1.862

Model Group Summary

The table below contains summary information for the five most similar model groups to neos-2987310-joes 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.592864 1
stein MIPLIB submission pool Imported from the MIPLIB2010 submissions. 1.726713 2
neos-pseudoapplication-21 NEOS Server Submission Imported from the MIPLIB2010 submissions. 1.800004 3
markshare G. Cornuéjols, M. Dawande Market sharing problem 1.800743 4
neos-pseudoapplication-74 Jeff Linderoth (None provided) 1.861708 5