×
![]()
neos-885524: Instance-to-Instance Comparison Results
| Type: | Instance |
| Submitter: | NEOS Server Submission |
| Description: | Instance coming from the NEOS Server with unknown application |
| MIPLIB Entry |
Parent Instance (neos-885524)
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 | eil33-2 [MIPLIB] | pythago7825 [MIPLIB] | iis-hc-cov [MIPLIB] | pythago7824 [MIPLIB] | f2gap801600 [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.841 | 2 / 0.867 | 3 / 0.875 | 4 / 0.908 | 5 / 0.935 | |
|
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 | eil33-2 [MIPLIB] | mod008inf [MIPLIB] | nsrand-ipx [MIPLIB] | n2seq36f [MIPLIB] | bppc6-06 [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.
|
1 / 0.841 | 379 / 2.089 | 398 / 2.105 | 868 / 2.357 | 990 / 2.542 | |
|
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-885524, the five most similar instances to neos-885524 according to the MIC, and the five most similar instances to neos-885524 according to MIPLIB 2017.
| INSTANCE | SUBMITTER | DESCRIPTION | ISS | RANK | |
|---|---|---|---|---|---|
| Parent Instance | neos-885524 [MIPLIB] | NEOS Server Submission | Instance coming from the NEOS Server with unknown application | 0.000000 | - |
| MIC Top 5 | eil33-2 [MIPLIB] | J. Linderoth | Set partitioning problem approximation for capicated vehicle routing problem instance from TSPLIB | 0.840779 | 1 |
| pythago7825 [MIPLIB] | Felix J. L. Willamowski | 2-coloring of Pythagorean triples | 0.867495 | 2 | |
| iis-hc-cov [MIPLIB] | Marc Pfetsch | 23 "middlehard" Set-Covering Instances for MIPLIB: they have a small number of variables compared to the number of constraints and CPLEX 12.1 needs about one hour to solve them.For more information, have a look into the readme file which explains how the instances can be created. | 0.875384 | 3 | |
| pythago7824 [MIPLIB] | Felix J. L. Willamowski | 2-coloring of Pythagorean triples | 0.907774 | 4 | |
| f2gap801600 [MIPLIB] | Salim Haddadi | Restrictions of well-known hard generalized assignment problem instances (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600) | 0.934791 | 5 | |
| MIPLIB Top 5 | eil33-2 [MIPLIB] | J. Linderoth | Set partitioning problem approximation for capicated vehicle routing problem instance from TSPLIB | 0.840779 | 1 |
| mod008inf [MIPLIB] | MIPLIB submission pool | Imported from the MIPLIB2010 submissions. | 2.088711 | 379 | |
| nsrand-ipx [MIPLIB] | MIPLIB submission pool | Imported from the MIPLIB2010 submissions. | 2.105338 | 398 | |
| n2seq36f [MIPLIB] | R. Meirich | Static line planning models on the Dutch IC network | 2.357451 | 868 | |
| bppc6-06 [MIPLIB] | Manuel Iori | The models that we attach solve the "bar-relaxation", also known as the "Bin Packing Problem with Contiguity" or the "P||Cmax with contiguity". This is one of the most interesting relaxations for two dimensional cutting and packing problems. Its solution by means of an ILP software is the bottleneck of the primal decomposition methods that we attempted in the paper cited below. In detail, the files correspond to model (12)-(15) in the paper, applied to the instances of the Classes 4, 6 and 8 by Martello and Vigo (Management Science, 1998). | 2.541705 | 990 |
neos-885524: Instance-to-Model Comparison Results
| Model Group Assignment from MIPLIB: | neos-pseudoapplication-100 |
| Assigned Model Group Rank/ISS in the MIC: | 159 / 2.780 |
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 | 2hopcds | generated | f2gap | independentset | neos-pseudoapplication-101 | |
|
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.144 | 2 / 1.192 | 3 / 1.207 | 4 / 1.214 | 5 / 1.229 |
Model Group Summary
The table below contains summary information for the five most similar model groups to neos-885524 according to the MIC.
| MODEL GROUP | SUBMITTER | DESCRIPTION | ISS | RANK | |
|---|---|---|---|---|---|
| MIC Top 5 | 2hopcds | Austin Buchanan | A problem in wireless networks. The objective is to select a minimum number of relay nodes so that any two nonadjacent nodes can communicate by way of the chosen relay nodes in at most s hops, where s is a problem input. The 2-hop case of this problem can be formulated as a set cover/hitting set problem with n binary variables and n^2 constraints: _{ k N(i) N(j) } x_k 1 for nonadjacent node pairs {i,j}. Despite the formulation's simplicity, models with as few as 120 variables are left unsolved after one hour using Gurobi 7.0.2. | 1.143737 | 1 |
| 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.191837 | 2 | |
| f2gap | Salim Haddadi | Restrictions of well-known hard generalized assignment problem models (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600) | 1.207202 | 3 | |
| independentset | Toni Sorrell | These models are based on Neil Sloane's Challenge problems: Independent Sets in Graphs. | 1.213916 | 4 | |
| neos-pseudoapplication-101 | NEOS Server Submission | Model coming from the NEOS Server with unknown application. Infeasibility claimed by CPLEX 12.6 and CPLEX 12.6.1 with extreme numerical caution emphasi after 4 and 2 hours computation, respectively. | 1.228911 | 5 |
