×
![]()
neos-5044663-wairoa: Instance-to-Instance Comparison Results
| Type: | Instance |
| Submitter: | Hans Mittelmann |
| Description: | NEOS submission with known submitter |
| MIPLIB Entry |
Parent Instance (neos-5044663-wairoa)
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 | aligninq [MIPLIB] | neos-4797081-pakoka [MIPLIB] | neos-3572885-glina [MIPLIB] | 23588 [MIPLIB] | osorio-cta [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.519 | 2 / 1.526 | 3 / 1.608 | 4 / 1.676 | 5 / 1.679 | |
|
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 | n9-3 [MIPLIB] | n5-3 [MIPLIB] | n6-3 [MIPLIB] | n7-3 [MIPLIB] | n13-3 [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.
|
281 / 2.054 | 375 / 2.114 | 382 / 2.116 | 399 / 2.123 | 477 / 2.148 | |
|
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-5044663-wairoa, the five most similar instances to neos-5044663-wairoa according to the MIC, and the five most similar instances to neos-5044663-wairoa according to MIPLIB 2017.
| INSTANCE | SUBMITTER | DESCRIPTION | ISS | RANK | |
|---|---|---|---|---|---|
| Parent Instance | neos-5044663-wairoa [MIPLIB] | Hans Mittelmann | NEOS submission with known submitter | 0.000000 | - |
| MIC Top 5 | aligninq [MIPLIB] | MIPLIB submission pool | Imported from the MIPLIB2010 submissions. | 1.519472 | 1 |
| neos-4797081-pakoka [MIPLIB] | Hans Mittelmann | Collection of anonymous submissions to the NEOS Server for Optimization | 1.525767 | 2 | |
| neos-3572885-glina [MIPLIB] | Jeff Linderoth | (None provided) | 1.608291 | 3 | |
| 23588 [MIPLIB] | MIPLIB submission pool | Imported from the MIPLIB2010 submissions. | 1.676291 | 4 | |
| 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.679171 | 5 | |
| MIPLIB Top 5 | n9-3 [MIPLIB] | A. Atamtürk | Capacitated network design problem | 2.053968 | 281 |
| n5-3 [MIPLIB] | A. Atamtürk | Capacitated network design problem | 2.113751 | 375 | |
| n6-3 [MIPLIB] | A. Atamtürk | Capacitated network design problem | 2.116293 | 382 | |
| n7-3 [MIPLIB] | A. Atamtürk | Capacitated network design problem | 2.123355 | 399 | |
| n13-3 [MIPLIB] | A. Atamtürk | Capacitated network design problem | 2.147667 | 477 |
neos-5044663-wairoa: Instance-to-Model Comparison Results
| Model Group Assignment from MIPLIB: | neos-pseudoapplication-53 |
| Assigned Model Group Rank/ISS in the MIC: | 1 / 0.0 |
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 | neos-pseudoapplication-53 | neos-pseudoapplication-108 | neos-pseudoapplication-4 | chromaticindex | scp | |
|
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.000 | 2 / 2.178 | 3 / 2.261 | 4 / 2.369 | 5 / 2.369 |
Model Group Summary
The table below contains summary information for the five most similar model groups to neos-5044663-wairoa according to the MIC.
| MODEL GROUP | SUBMITTER | DESCRIPTION | ISS | RANK | |
|---|---|---|---|---|---|
| MIC Top 5 | neos-pseudoapplication-53 | Hans Mittelmann | NEOS submission with known submitter | 0.000000 | 1 |
| neos-pseudoapplication-108 | NEOS Server Submission | Model coming from the NEOS Server with unknown application | 2.178228 | 2 | |
| neos-pseudoapplication-4 | Jeff Linderoth | (None provided) | 2.261040 | 3 | |
| chromaticindex | Pierre Le Bodic | Simple edge-coloring model on chains of Petersen-like subgraphs, designed to fool MIP solvers into producing very large Branch-and-Bound trees. | 2.368523 | 4 | |
| 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 | 2.368755 | 5 |
