×
net12: Instance-to-Instance Comparison Results
Type: | Instance |
Submitter: | P. Belotti |
Description: | Network design instance |
MIPLIB Entry |
Parent Instance (net12)
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 | n7-3 [MIPLIB] | n6-3 [MIPLIB] | gus-sch [MIPLIB] | comp08-2idx [MIPLIB] | neos-555884 [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.389 | 2 / 0.410 | 3 / 0.430 | 4 / 0.440 | 5 / 0.441 | |
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 | istanbul-no-cutoff [MIPLIB] | loopha13 [MIPLIB] | snip10x10-35r1budget17 [MIPLIB] | neos-4477313-unzha [MIPLIB] | neos-691058 [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.
|
210 / 1.108 | 249 / 1.201 | 666 / 1.792 | 681 / 1.834 | 841 / 2.217 | |
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 net12, the five most similar instances to net12 according to the MIC, and the five most similar instances to net12 according to MIPLIB 2017.
INSTANCE | SUBMITTER | DESCRIPTION | ISS | RANK | |
---|---|---|---|---|---|
Parent Instance | net12 [MIPLIB] | P. Belotti | Network design instance | 0.000000 | - |
MIC Top 5 | n7-3 [MIPLIB] | A. Atamtürk | Capacitated network design problem | 0.388620 | 1 |
n6-3 [MIPLIB] | A. Atamtürk | Capacitated network design problem | 0.410027 | 2 | |
gus-sch [MIPLIB] | Alexandra M. Newman | course scheduling model | 0.429844 | 3 | |
comp08-2idx [MIPLIB] | Matias Sørensen | Instances comp01-21 of curriculum based course timetabling from the International Timetabling Competition 2007. These are time-assignment models (Stage I of the decomposed model), which are smaller than the full model, but still hard to solve. | 0.439852 | 4 | |
neos-555884 [MIPLIB] | NEOS Server Submission | Imported from the MIPLIB2010 submissions. | 0.440685 | 5 | |
MIPLIB Top 5 | istanbul-no-cutoff [MIPLIB] | Utz-Uwe Haus | Exact MILP reformulation using binary decision diagrams to obtain scenario bundles of 2-stage stochastic expected shortest path and expected maximum flow problem with decision dependent scenario probabilities. Notes: * very few binary variables * for each fixing of the binaries a system of equations computing conditioned probabilities remains | 1.108377 | 210 |
loopha13 [MIPLIB] | Hamideh | This is a Gams model which uses CPLEX as a solver. | 1.200771 | 249 | |
snip10x10-35r1budget17 [MIPLIB] | Utz-Uwe Haus | Exact MILP reformulation using binary decision diagrams to obtain scenario bundles of 2-stage stochastic expected shortest path and expected maximum flow problem with decision dependent scenario probabilities. Notes: * very few binary variables * for each fixing of the binaries a system of equations computing conditioned probabilities remains | 1.792476 | 666 | |
neos-4477313-unzha [MIPLIB] | Jeff Linderoth | (None provided) | 1.833570 | 681 | |
neos-691058 [MIPLIB] | NEOS Server Submission | Imported from the MIPLIB2010 submissions. | 2.216928 | 841 |
net12: 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 | aflow | nus-prxy | ab | neos-pseudoapplication-60 | seqsolve | |
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.696 | 2 / 0.735 | 3 / 0.795 | 4 / 0.890 | 5 / 0.909 |
Model Group Summary
The table below contains summary information for the five most similar model groups to net12 according to the MIC.
MODEL GROUP | SUBMITTER | DESCRIPTION | ISS | RANK | |
---|---|---|---|---|---|
MIC Top 5 | aflow | T. Achterberg | Arborescence flow problem on a graph with 40 nodes and edge density 0.9 | 0.695636 | 1 |
nus-prxy | MIPLIB submission pool | Imported from the MIPLIB2010 submissions. | 0.735336 | 2 | |
ab | MIPLIB submission pool | Imported from the MIPLIB2010 submissions. | 0.795411 | 3 | |
neos-pseudoapplication-60 | NEOS Server Submission | Model coming from the NEOS Server with unknown application | 0.890248 | 4 | |
seqsolve | Irv Lustig | The 3 problems in this group (seqsolve1-seqsolve3) represent a hierarchical optimization process, which is derived from a customer problem for assigning people to sites into blocks of time on days of the week. The specialty of this submission is that the best known solution for seqsolveX can be used as a MIP start for seqsolveX+1. For a description of the connections between the problems, please refer to the README.txt contained in the model data for this submission, which also includes MIP start files and a Gurobi log file. | 0.908843 | 5 |