×
neos-5041822-cockle: Instance-to-Instance Comparison Results
Type: | Instance |
Submitter: | Jeff Linderoth |
Description: | (None provided) |
MIPLIB Entry |
Parent Instance (neos-5041822-cockle)
All other instances below were be compared against this "query" instance.
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.
|
||||||
Name | f2gap40400 [MIPLIB] | gen-ip054 [MIPLIB] | scpm1 [MIPLIB] | gen-ip002 [MIPLIB] | markshare2 [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.194 | 2 / 1.203 | 3 / 1.228 | 4 / 1.248 | 5 / 1.253 | |
Raw
These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIC top 5.
|
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.
|
||||||
Name | unitcal_7 [MIPLIB] | set3-20 [MIPLIB] | set3-16* [MIPLIB] | set3-10* [MIPLIB] | set3-15* [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.
|
614 / 1.734 | 617 / 1.735 | 617* / 1.735* | 617* / 1.735* | 617* / 1.735* | |
Raw
These images represent the CCM images in their raw forms (before any decomposition was applied) for the MIPLIB top 5.
|
Instance Summary
The table below contains summary information for neos-5041822-cockle, the five most similar instances to neos-5041822-cockle according to the MIC, and the five most similar instances to neos-5041822-cockle according to MIPLIB 2017.
INSTANCE | SUBMITTER | DESCRIPTION | ISS | RANK | |
---|---|---|---|---|---|
Parent Instance | neos-5041822-cockle [MIPLIB] | Jeff Linderoth | (None provided) | 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.193773 | 1 |
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.203027 | 2 | |
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.227598 | 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.247777 | 4 | |
markshare2 [MIPLIB] | G. Cornuéjols, M. Dawande | Market sharing problem | 1.252562 | 5 | |
MIPLIB Top 5 | unitcal_7 [MIPLIB] | R. O’Neill | California seven day unit commitment problem | 1.734142 | 614 |
set3-20 [MIPLIB] | Kerem Akartunali | Multi-item lot-sizing with backlogging. Solved by SCIP 3.1.1 parallelized by UG 0.7.5 linked to CPLEX 12.6 as an LP solver on HLRN III (https://www.hlrn.de/home/view/System3/CrayHardware). Due to time limit restrictions, four repeated runs, each starting from the checkpointing file of the previous run, were done. Each run had a time limit of 12 hours while using 6144 (runs 1) or 3072 cores (run 2 - 4). | 1.734889 | 617 | |
set3-16* [MIPLIB] | Kerem Akartunali | This is joint work with Andrew J. Miller, Universite de Bordeaux 1; RealOpt, INRIA Bordeaux Sud-Ouest, France. Andrew.Miller@math.u-bordeaux1.fr. These are five hard instances chosen from our library MULTILSB (Multi-item Lot-Sizing with Backlogging), which is fully available at (incl. documentation and mosel file):http://personal.strath.ac.uk/kerem.akartunali/research/multi-lsb/ For these 5 instances, gaps remain in the range of >50% after 30 min. (using latest version of FICO on a laptop with i7 processor and 4GB RAM): (first two columns indicate the 30 min-runs, and the last column indicates the best solutions we know at the moment). Computational results for these instances as well as for others of MULTILSB can be found on the website. | 1.734889* | 617* | |
set3-10* [MIPLIB] | Kerem Akartunali | Multi-item lot-sizing with backlogging. Solved by SCIP 3.1.1 parallelized by UG 0.7.5 linked to CPLEX 12.6 as an LP solver on HLRN III (https://www.hlrn.de/home/view/System3/CrayHardware). Due to time limit restrictions, five repeated runs, each starting from the checkpointing file of the previous run, were done. Each run had a time limit of 12 hours while using 6144 (runs 1, 3, and 4) or 3072 cores (run 2 and 5). | 1.734889* | 617* | |
set3-15* [MIPLIB] | Kerem Akartunali | Multi-item lot-sizing with backlogging. The problem was solved with CPLEX 12.4 in approximately 64.5 hours. | 1.734889* | 617* |
neos-5041822-cockle: Instance-to-Model Comparison Results
Model Group Assignment from MIPLIB: | neos-pseudoapplication-25 |
Assigned Model Group Rank/ISS in the MIC: | 110 / 2.628 |
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.
|
||||||
Name | scp | neos-pseudoapplication-74 | markshare | neos-pseudoapplication-107 | 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.684 | 2 / 1.783 | 3 / 1.800 | 4 / 1.828 | 5 / 1.868 |
Model Group Summary
The table below contains summary information for the five most similar model groups to neos-5041822-cockle 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.684362 | 1 |
neos-pseudoapplication-74 | Jeff Linderoth | (None provided) | 1.782576 | 2 | |
markshare | G. Cornuéjols, M. Dawande | Market sharing problem | 1.799805 | 3 | |
neos-pseudoapplication-107 | Jeff Linderoth | (None provided) | 1.827869 | 4 | |
enlight | A. Zymolka | Model to solve model of a combinatorial game ``EnLight'' Imported from the MIPLIB2010 submissions. | 1.868077 | 5 |