×
![]()
msc98-ip: Instance-to-Instance Comparison Results
| Type: | Instance |
| Submitter: | E-Plus, D. Bienstock, A. Bley, R. Wessäly |
| Description: | Min-cost network dimensioning problems with a finite set of link capacities for each bidirected link, unsplittable shortest path routing, path restoration for single node failures, and routing path length restrictions |
| MIPLIB Entry |
Parent Instance (msc98-ip)
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] | neos-885524 [MIPLIB] | neos-4382714-ruvuma [MIPLIB] | eilC76-2 [MIPLIB] | 2club200v15p5scn [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.332 | 2 / 1.441 | 3 / 1.491 | 4 / 1.503 | 5 / 1.503 | |
|
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 | atlanta-ip [MIPLIB] | lr1dr02vc05v8a-t360 [MIPLIB] | neos-1067731 [MIPLIB] | neos-4358725-tagus [MIPLIB] | neos-3068746-nene [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.
|
14 / 1.551 | 125 / 2.063 | 154 / 2.169 | 167 / 2.190 | 622 / 2.651 | |
|
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 msc98-ip, the five most similar instances to msc98-ip according to the MIC, and the five most similar instances to msc98-ip according to MIPLIB 2017.
| INSTANCE | SUBMITTER | DESCRIPTION | ISS | RANK | |
|---|---|---|---|---|---|
| Parent Instance | msc98-ip [MIPLIB] | E-Plus, D. Bienstock, A. Bley, R. Wessäly | Min-cost network dimensioning problems with a finite set of link capacities for each bidirected link, unsplittable shortest path routing, path restoration for single node failures, and routing path length restrictions | 0.000000 | - |
| MIC Top 5 | eil33-2 [MIPLIB] | J. Linderoth | Set partitioning problem approximation for capicated vehicle routing problem instance from TSPLIB | 1.331754 | 1 |
| neos-885524 [MIPLIB] | NEOS Server Submission | Instance coming from the NEOS Server with unknown application | 1.440814 | 2 | |
| neos-4382714-ruvuma [MIPLIB] | Hans Mittelmann | Collection of anonymous submissions to the NEOS Server for Optimization | 1.490907 | 3 | |
| eilC76-2 [MIPLIB] | J. Linderoth | Set partitioning problem approximation for capicated vehicle routing problem instance from TSPLIB Imported from the MIPLIB2010 submissions. | 1.503013 | 4 | |
| 2club200v15p5scn [MIPLIB] | Balabhaskar Balasundaram | Maximum 2-club instance; graph; clique relaxations Solved with Gurobi 8.1 on 24 cores in approx. 23 hours. | 1.503211 | 5 | |
| MIPLIB Top 5 | atlanta-ip [MIPLIB] | E-Plus, D. Bienstock, A. Bley, R. Wessäly | Min-cost network dimensioning problems with a finite set of link capacities for each bidirected link, unsplittable shortest path routing, path restoration for single node failures, and routing path length restrictions | 1.550803 | 14 |
| lr1dr02vc05v8a-t360 [MIPLIB] | Dimitri Papageorgiou | Maritime Inventory Routing Problem Library - Group 2 Instances. These instances are available at https://mirplib.scl.gatech.edu/instances, along with a host of additional information such as the underlying data used to generate the model, best known upper and lower bounds, and more. There are three sets of 24 instances (for a total of 72 instances) with a planning horizon of 120, 180, and 360 time periods, respectively. As of March 2016, Cplex and Gurobi could only solve one or two to provably optimality in less than an hour. | 2.063308 | 125 | |
| neos-1067731 [MIPLIB] | NEOS Server Submission | Imported from the MIPLIB2010 submissions. | 2.168962 | 154 | |
| neos-4358725-tagus [MIPLIB] | Jeff Linderoth | (None provided) | 2.189706 | 167 | |
| neos-3068746-nene [MIPLIB] | Jeff Linderoth | (None provided) | 2.651033 | 622 |
msc98-ip: Instance-to-Model Comparison Results
| Model Group Assignment from MIPLIB: | no model group assignment |
| Assigned Model Group Rank/ISS in the MIC: | N.A. / N.A. |
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-101 | f2gap | 2hopcds | independentset | generated | |
|
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.905 | 2 / 1.914 | 3 / 1.940 | 4 / 1.975 | 5 / 1.983 |
Model Group Summary
The table below contains summary information for the five most similar model groups to msc98-ip according to the MIC.
| MODEL GROUP | SUBMITTER | DESCRIPTION | ISS | RANK | |
|---|---|---|---|---|---|
| MIC Top 5 | 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.904860 | 1 |
| f2gap | Salim Haddadi | Restrictions of well-known hard generalized assignment problem models (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600) | 1.914422 | 2 | |
| 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.939867 | 3 | |
| independentset | Toni Sorrell | These models are based on Neil Sloane's Challenge problems: Independent Sets in Graphs. | 1.974787 | 4 | |
| 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.982919 | 5 |
