×
![]()
neos-859770: 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-859770)
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 | air04 [MIPLIB] | core2536-691 [MIPLIB] | eilC76-2 [MIPLIB] | v150d30-2hopcds [MIPLIB] | scpj4scip [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.147 | 2 / 1.154 | 3 / 1.162 | 4 / 1.193 | 5 / 1.197 | |
|
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 | bab3 [MIPLIB] | bab5 [MIPLIB] | n2seq36q [MIPLIB] | bab2 [MIPLIB] | neos-941313 [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.
|
94 / 1.892 | 211 / 2.341 | 242 / 2.415 | 391 / 2.652 | 862 / 3.005 | |
|
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-859770, the five most similar instances to neos-859770 according to the MIC, and the five most similar instances to neos-859770 according to MIPLIB 2017.
| INSTANCE | SUBMITTER | DESCRIPTION | ISS | RANK | |
|---|---|---|---|---|---|
| Parent Instance | neos-859770 [MIPLIB] | NEOS Server Submission | Instance coming from the NEOS Server with unknown application | 0.000000 | - |
| MIC Top 5 | air04 [MIPLIB] | G. Astfalk | Airline crew scheduling set partitioning problem | 1.146579 | 1 |
| core2536-691 [MIPLIB] | A. Caprara, M. Fischetti, P. Toth | Set covering instance coming from Italian railway models | 1.154458 | 2 | |
| eilC76-2 [MIPLIB] | J. Linderoth | Set partitioning problem approximation for capicated vehicle routing problem instance from TSPLIB Imported from the MIPLIB2010 submissions. | 1.162293 | 3 | |
| v150d30-2hopcds [MIPLIB] | 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, instances with as few as 120 variables are left unsolved after one hour using Gurobi 7.0.2. | 1.193200 | 4 | |
| scpj4scip [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.197422 | 5 | |
| MIPLIB Top 5 | bab3 [MIPLIB] | Elmar Swarat | Vehicle routing with profits and an integrated crew scheduling problem formulated by two coupled multi-commodity flow problems | 1.892449 | 94 |
| bab5 [MIPLIB] | Elmar Swarat | Vehicle routing with profits and an integrated crew scheduling problem formulated by two coupled multi-commodity flow problems | 2.341479 | 211 | |
| n2seq36q [MIPLIB] | R. Meirich | Static line planning models on the Dutch IC network | 2.414614 | 242 | |
| bab2 [MIPLIB] | Elmar Swarat | Vehicle Routing with profits and an integrated crew scheduling formulated by two coupled multi-commodity flow problems. | 2.652067 | 391 | |
| neos-941313 [MIPLIB] | NEOS Server Submission | Instance coming from the NEOS Server with unknown application | 3.004961 | 862 |
neos-859770: Instance-to-Model Comparison Results
| Model Group Assignment from MIPLIB: | neos-pseudoapplication-81 |
| Assigned Model Group Rank/ISS in the MIC: | 1 / 0.931 |
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-81 | 2hopcds | f2gap | mod | maxfeassub | |
|
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.932 | 2 / 1.185 | 3 / 1.303 | 4 / 1.346 | 5 / 1.376 |
Model Group Summary
The table below contains summary information for the five most similar model groups to neos-859770 according to the MIC.
| MODEL GROUP | SUBMITTER | DESCRIPTION | ISS | RANK | |
|---|---|---|---|---|---|
| MIC Top 5 | neos-pseudoapplication-81 | Hans Mittelmann | Collection of anonymous submissions to the NEOS Server for Optimization | 0.931692 | 1 |
| 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.185335 | 2 | |
| f2gap | Salim Haddadi | Restrictions of well-known hard generalized assignment problem models (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600) | 1.303499 | 3 | |
| mod | MIPLIB submission pool | Imported from the MIPLIB2010 submissions. | 1.345733 | 4 | |
| maxfeassub | Marc Pfetsch | Set covering problems arising from a Benders algorithm for finding maximum feasible subsystems. More details on the generation is given in the README file in the tarball. | 1.375526 | 5 |
