×
nsr8k: Instance-to-Instance Comparison Results
Type: | Instance |
Submitter: | MIPLIB submission pool |
Description: | Crew scheduling instance |
MIPLIB Entry |
Parent Instance (nsr8k)
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 | dolom1 [MIPLIB] | dc1c [MIPLIB] | trento1 [MIPLIB] | biella1 [MIPLIB] | v150d30-2hopcds [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.039 | 2 / 1.077 | 3 / 1.141 | 4 / 1.211 | 5 / 1.331 | |
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 | dolom1 [MIPLIB] | dc1c [MIPLIB] | trento1 [MIPLIB] | biella1 [MIPLIB] | dc1l [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.
|
1 / 1.039 | 2 / 1.077 | 3 / 1.141 | 4 / 1.211 | 8 / 1.394 | |
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 nsr8k, the five most similar instances to nsr8k according to the MIC, and the five most similar instances to nsr8k according to MIPLIB 2017.
INSTANCE | SUBMITTER | DESCRIPTION | ISS | RANK | |
---|---|---|---|---|---|
Parent Instance | nsr8k [MIPLIB] | MIPLIB submission pool | Crew scheduling instance | 0.000000 | - |
MIC Top 5 | dolom1 [MIPLIB] | Double-Click SAS | Crew scheduling instance. Solved with ParaSCIP with SCIP 3.0.1 linked to CPLEX 12.5 as an LP solver on HLRN III with 12288 cores in two runs First run found a feasible solution whose objective function value is 6615265.0000. Giving the feasible solution, the second run solved the instance in 13684.7671 sec. | 1.038749 | 1 |
dc1c [MIPLIB] | Double-Click SAS | Crew scheduling instance. This problem was solved on ISM supercomputer Fujitsu PRIMERGY RX200S5 (http://www.ism.ac.jp/computer_system/eng/sc/index.html) by ParaSCIP in approximately 1100 hours with 14 times restarted 15 jobs. | 1.076891 | 2 | |
trento1 [MIPLIB] | MIPLIB submission pool | Imported from the MIPLIB2010 submissions. | 1.141142 | 3 | |
biella1 [MIPLIB] | Double-Click SAS | Crew scheduling instance | 1.210959 | 4 | |
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.331033 | 5 | |
MIPLIB Top 5 | dolom1 [MIPLIB] | Double-Click SAS | Crew scheduling instance. Solved with ParaSCIP with SCIP 3.0.1 linked to CPLEX 12.5 as an LP solver on HLRN III with 12288 cores in two runs First run found a feasible solution whose objective function value is 6615265.0000. Giving the feasible solution, the second run solved the instance in 13684.7671 sec. | 1.038749 | 1 |
dc1c [MIPLIB] | Double-Click SAS | Crew scheduling instance. This problem was solved on ISM supercomputer Fujitsu PRIMERGY RX200S5 (http://www.ism.ac.jp/computer_system/eng/sc/index.html) by ParaSCIP in approximately 1100 hours with 14 times restarted 15 jobs. | 1.076891 | 2 | |
trento1 [MIPLIB] | MIPLIB submission pool | Imported from the MIPLIB2010 submissions. | 1.141142 | 3 | |
biella1 [MIPLIB] | Double-Click SAS | Crew scheduling instance | 1.210959 | 4 | |
dc1l [MIPLIB] | Double-Click SAS | Crew scheduling instance | 1.393724 | 8 |
nsr8k: 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-5 | neos-pseudoapplication-23 | neos-pseudoapplication-46 | bppc | sct | |
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.696 | 2 / 1.708 | 3 / 1.731 | 4 / 1.753 | 5 / 1.757 |
Model Group Summary
The table below contains summary information for the five most similar model groups to nsr8k according to the MIC.
MODEL GROUP | SUBMITTER | DESCRIPTION | ISS | RANK | |
---|---|---|---|---|---|
MIC Top 5 | neos-pseudoapplication-5 | NEOS Server Submission | Imported from the MIPLIB2010 submissions. | 1.696024 | 1 |
neos-pseudoapplication-23 | NEOS Server Submission | Imported from the MIPLIB2010 submissions. | 1.707534 | 2 | |
neos-pseudoapplication-46 | NEOS Server Submission | Imported from the MIPLIB2010 submissions. | 1.731312 | 3 | |
bppc | Manuel Iori | The models that we attach solve the "bar-relaxation", also known as the "Bin Packing Problem with Contiguity" or the "P||Cmax with contiguity". This is one of the most interesting relaxations for two dimensional cutting and packing problems. Its solution by means of an ILP software is the bottleneck of the primal decomposition methods that we attempted in the paper cited below. In detail, the files correspond to model (12)-(15) in the paper, applied to the models of the Classes 4, 6 and 8 by Martello and Vigo (Management Science, 1998). | 1.752599 | 4 | |
sct | Siemens | Assembly line balancing for printed circuit board production. First solved by Gurobi 7.0 in 65 hours (32 threads). | 1.757232 | 5 |