×
supportcase10: Instance-to-Instance Comparison Results
Type: | Instance |
Submitter: | Michael Winkler |
Description: | MIP instances collected from Gurobi forum with unknown application |
MIPLIB Entry |
Parent Instance (supportcase10)
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 | tpl-tub-ss16 [MIPLIB] | bab3 [MIPLIB] | tpl-tub-ws1617 [MIPLIB] | iis-hc-cov [MIPLIB] | icir97_tension [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.602 | 2 / 1.647 | 3 / 1.675 | 4 / 1.697 | 5 / 1.736 | |
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 | genus-sym-g62-2 [MIPLIB] | neos-3283608-agout [MIPLIB] | ns1828997 [MIPLIB] | genus-g61-25 [MIPLIB] | neos-950242 [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.
|
75 / 2.146 | 170 / 2.411 | 382 / 2.665 | 388 / 2.672 | 966 / 3.091 | |
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 supportcase10, the five most similar instances to supportcase10 according to the MIC, and the five most similar instances to supportcase10 according to MIPLIB 2017.
INSTANCE | SUBMITTER | DESCRIPTION | ISS | RANK | |
---|---|---|---|---|---|
Parent Instance | supportcase10 [MIPLIB] | Michael Winkler | MIP instances collected from Gurobi forum with unknown application | 0.000000 | - |
MIC Top 5 | tpl-tub-ss16 [MIPLIB] | János Höner | Model for the Post-Enrollment Course Timetabling Problem at TU Berlin from the summer term 2016 and the winter term 2016/2017 | 1.601854 | 1 |
bab3 [MIPLIB] | Elmar Swarat | Vehicle routing with profits and an integrated crew scheduling problem formulated by two coupled multi-commodity flow problems | 1.646937 | 2 | |
tpl-tub-ws1617 [MIPLIB] | János Höner | Model for the Post-Enrollment Course Timetabling Problem at TU Berlin from the summer term 2016 and the winter term 2016/2017 | 1.675326 | 3 | |
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. | 1.697329 | 4 | |
icir97_tension [MIPLIB] | MIPLIB submission pool | Imported from the MIPLIB2010 submissions. | 1.736455 | 5 | |
MIPLIB Top 5 | genus-sym-g62-2 [MIPLIB] | Stephan Beyer | Minimum Genus instance, with symmetry breaking constraints, of g.62.2 (undirected) of the AT&T Graphs by Stephen C. North. | 2.145721 | 75 |
neos-3283608-agout [MIPLIB] | Jeff Linderoth | (None provided) | 2.410769 | 170 | |
ns1828997 [MIPLIB] | NEOS Server Submission | Instance coming from the NEOS Server with unknown application. | 2.665194 | 382 | |
genus-g61-25 [MIPLIB] | Stephan Beyer | Minimum Genus instance of g.61.25 (undirected) of the AT&T Graphs by Stephen C. North. | 2.671804 | 388 | |
neos-950242 [MIPLIB] | NEOS Server Submission | Imported from the MIPLIB2010 submissions. | 3.090928 | 966 |
supportcase10: 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 | gmu | generated | neos-pseudoapplication-101 | independentset | 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 / 2.219 | 2 / 2.276 | 3 / 2.300 | 4 / 2.308 | 5 / 2.329 |
Model Group Summary
The table below contains summary information for the five most similar model groups to supportcase10 according to the MIC.
MODEL GROUP | SUBMITTER | DESCRIPTION | ISS | RANK | |
---|---|---|---|---|---|
MIC Top 5 | gmu | Nora Konnyu | Timber harvest scheduling model These are harvest scheduling models of hypothetical forest planning problems where net timber revenues are maximized over a planning horizon subject to four sets of constraints: 1. Each management unit can be harvested only once over the planning horizon, 2. Volume harvested in one planning period should not be less or more than some portion of that in the preceding period, 3. Area-weighted average age of the forest by the end of the plan should notbe less than a certain target age. 4. Clearcut size in any planning period has to be below a specific limit. Decision variable are management units and generalized management units (group of management units with a combined area not exceeding the limit on clearcut size) and can be either fully harvested or left untouched in any planning period, therefore there is a binary restriction on the decision variables. | 2.218663 | 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. | 2.276142 | 2 | |
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. | 2.300357 | 3 | |
independentset | Toni Sorrell | These models are based on Neil Sloane's Challenge problems: Independent Sets in Graphs. | 2.307956 | 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. | 2.329229 | 5 |