×
neos-860300: Instance-to-Instance Comparison Results
Type: | Instance |
Submitter: | NEOS Server Submission |
Description: | Imported from the MIPLIB2010 submissions. |
MIPLIB Entry |
Parent Instance (neos-860300)
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 | neos-4760493-puerua [MIPLIB] | supportcase6 [MIPLIB] | queens-30 [MIPLIB] | neos-5013590-toitoi [MIPLIB] | t1717 [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.019 | 2 / 1.083 | 3 / 1.151 | 4 / 1.189 | 5 / 1.192 | |
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 | misc07 [MIPLIB] | neos-3216931-puriri [MIPLIB] | neos-3214367-sovi [MIPLIB] | nursesched-medium04 [MIPLIB] | nursesched-sprint02 [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.
|
128 / 2.462 | 133 / 2.485 | 137 / 2.543 | 164 / 2.688 | 183 / 2.749 | |
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-860300, the five most similar instances to neos-860300 according to the MIC, and the five most similar instances to neos-860300 according to MIPLIB 2017.
INSTANCE | SUBMITTER | DESCRIPTION | ISS | RANK | |
---|---|---|---|---|---|
Parent Instance | neos-860300 [MIPLIB] | NEOS Server Submission | Imported from the MIPLIB2010 submissions. | 0.000000 | - |
MIC Top 5 | neos-4760493-puerua [MIPLIB] | Hans Mittelmann | Collection of anonymous submissions to the NEOS Server for Optimization | 1.019471 | 1 |
supportcase6 [MIPLIB] | Michael Winkler | MIP instances collected from Gurobi forum with unknown application | 1.083332 | 2 | |
queens-30 [MIPLIB] | Ashutosh Mahajan | Models the problem of placing as many queens on a 30 by 30 chess board as possible so that each queen threatens at most one other queen. | 1.151302 | 3 | |
neos-5013590-toitoi [MIPLIB] | Hans Mittelmann | additional files should be Gurobi output and solution and submitter | 1.189331 | 4 | |
t1717 [MIPLIB] | R. Borndörfer | Vehicle scheduling set partitioning problem from Berlin's Telebus handicapped people's transportation system | 1.191606 | 5 | |
MIPLIB Top 5 | misc07 [MIPLIB] | MIPLIB submission pool | Imported from the MIPLIB2010 submissions. | 2.461876 | 128 |
neos-3216931-puriri [MIPLIB] | Jeff Linderoth | (None provided) | 2.485123 | 133 | |
neos-3214367-sovi [MIPLIB] | Jeff Linderoth | Solved in 21 days with four restarted runs of ParaXpress. | 2.543346 | 137 | |
nursesched-medium04 [MIPLIB] | Haroldo Gambini Santos | Nurse Scheduling Problems from the First International Nurse Rostering Competition - INRC 2010 | 2.687548 | 164 | |
nursesched-sprint02 [MIPLIB] | Haroldo Gambini Santos | Nurse Scheduling Problems from the First International Nurse Rostering Competition - INRC 2010 | 2.748701 | 183 |
neos-860300: Instance-to-Model Comparison Results
Model Group Assignment from MIPLIB: | neos-pseudoapplication-23 |
Assigned Model Group Rank/ISS in the MIC: | 1 / 0.632 |
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-23 | iis | air | neos-pseudoapplication-106 | 2hopcds | |
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.633 | 2 / 1.315 | 3 / 1.343 | 4 / 1.437 | 5 / 1.498 |
Model Group Summary
The table below contains summary information for the five most similar model groups to neos-860300 according to the MIC.
MODEL GROUP | SUBMITTER | DESCRIPTION | ISS | RANK | |
---|---|---|---|---|---|
MIC Top 5 | neos-pseudoapplication-23 | NEOS Server Submission | Imported from the MIPLIB2010 submissions. | 0.632782 | 1 |
iis | Marc Pfetsch | 23 "middlehard" Set-Covering Models 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 models can be created. | 1.315041 | 2 | |
air | G. Astfalk | Airline crew scheduling set partitioning problem | 1.343135 | 3 | |
neos-pseudoapplication-106 | Hans Mittelmann | Collection of anonymous submissions to the NEOS Server for Optimization | 1.436550 | 4 | |
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.497737 | 5 |