×
neos-780889: Instance-to-Instance Comparison Results
Type: | Instance |
Submitter: | NEOS Server Submission |
Description: | Imported from the MIPLIB2010 submissions. |
MIPLIB Entry |
Parent Instance (neos-780889)
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 | thor50dday [MIPLIB] | graph40-20-1rand [MIPLIB] | graph20-80-1rand [MIPLIB] | graph40-40-1rand [MIPLIB] | neos-876808 [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.665 | 2 / 0.677 | 3 / 0.681 | 4 / 0.683 | 5 / 0.684 | |
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 | neos-831188 [MIPLIB] | neos-555001 [MIPLIB] | rail03 [MIPLIB] | rail02 [MIPLIB] | rail01 [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.
|
416 / 1.345 | 429 / 1.361 | 655 / 1.632 | 776 / 1.908 | 782 / 1.931 | |
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-780889, the five most similar instances to neos-780889 according to the MIC, and the five most similar instances to neos-780889 according to MIPLIB 2017.
INSTANCE | SUBMITTER | DESCRIPTION | ISS | RANK | |
---|---|---|---|---|---|
Parent Instance | neos-780889 [MIPLIB] | NEOS Server Submission | Imported from the MIPLIB2010 submissions. | 0.000000 | - |
MIC Top 5 | thor50dday [MIPLIB] | Daniel Rehfeldt | Steiner tree problem in graphs instance, consisting of a complete graph with 231 vertices of which 50 are terminals. The vertices correspond to cities (mostly capitals) around the world, the edges weights correspond to the distances in km. | 0.664749 | 1 |
graph40-20-1rand [MIPLIB] | Michael Bastubbe | Packing Cuts in Undirected Graphs. Instances are described in 4.1. | 0.676639 | 2 | |
graph20-80-1rand [MIPLIB] | Michael Bastubbe | Packing Cuts in Undirected Graphs. Instances are described in 4.1. | 0.680891 | 3 | |
graph40-40-1rand [MIPLIB] | Michael Bastubbe | Packing Cuts in Undirected Graphs. Instances are described in 4.1. | 0.682631 | 4 | |
neos-876808 [MIPLIB] | NEOS Server Submission | Imported from the MIPLIB2010 submissions. | 0.683883 | 5 | |
MIPLIB Top 5 | neos-831188 [MIPLIB] | NEOS Server Submission | Imported from the MIPLIB2010 submissions. | 1.344783 | 416 |
neos-555001 [MIPLIB] | NEOS Server Submission | Imported from the MIPLIB2010 submissions. | 1.360875 | 429 | |
rail03 [MIPLIB] | Thomas Schlechte | Track allocation problem modeled as arc coupling problem The problem was solved by CPLEX 12.4. It took approximately 170 hours. | 1.631552 | 655 | |
rail02 [MIPLIB] | Thomas Schlechte | Track allocation problem modeled as arc coupling problem | 1.907962 | 776 | |
rail01 [MIPLIB] | Thomas Schlechte | Track allocation problem modeled as arc coupling problem | 1.931419 | 782 |
neos-780889: Instance-to-Model Comparison Results
Model Group Assignment from MIPLIB: | neos-pseudoapplication-94 |
Assigned Model Group Rank/ISS in the MIC: | 201 / 3.553 |
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 | n37 | radiation | graphs | map | polygonpack | |
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.885 | 3 / 0.898 | 4 / 0.901 | 5 / 0.906 |
Model Group Summary
The table below contains summary information for the five most similar model groups to neos-780889 according to the MIC.
MODEL GROUP | SUBMITTER | DESCRIPTION | ISS | RANK | |
---|---|---|---|---|---|
MIC Top 5 | n37 | J. Aronson | Fixed charge transportation problem | 0.841089 | 1 |
radiation | Gleb Belov | Linearized Constraint Programming models of the MiniZinc Challenges 2012-2016. I should be able to produce versions with indicator constraints supported by Gurobi and CPLEX, however don't know if you can use them and if there is a standard format. These MPS were produced by Gurobi 7.0.2 using the MiniZinc develop branch on eb536656062ca13325a96b5d0881742c7d0e3c38 | 0.885481 | 2 | |
graphs | Michael Bastubbe | Packing Cuts in Undirected Graphs. Models are described in 4.1. | 0.897905 | 3 | |
map | Kiyan Ahmadizadeh | Land parcel selection problems motivated by Red-Cockaded Woodpecker conservation problem | 0.901491 | 4 | |
polygonpack | Antonio Frangioni | Given a set P of polygons, not necessarily convex, and a rectangle, we want to find the subset S of P with largest possible total area and a position every p in S so that there are no overlaps and they are all included in the rectangle. We allow a small set of rotations (0, 90, 180, 270 degrees) for every polygon. The problem is simplified w.r.t. the real application because the polygons do not have (fully encircled) "holes", which are supposedly filled-in separately, although they can have "bays". Models are saved as .lp. Model LpPackingModel_Dim means that we are trying to pack polygons taken from set ; there are currently 5 different sets, and is 7, 10 or 15. | 0.905544 | 5 |