×
uct-subprob: Instance-to-Instance Comparison Results
Type: | Instance |
Submitter: | Gerald Lach |
Description: | Subproblem of a university course timetabling problem. Switched to "easy" because it was solved by Gurobi 5.0 in 2106 seconds (May 2012). |
MIPLIB Entry |
Parent Instance (uct-subprob)
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 | icir97_potential [MIPLIB] | shiftreg5-1 [MIPLIB] | rd-rplusc-21 [MIPLIB] | neos-3611447-jijia [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 other instances. A smaller ISS value indicates greater similarity.
|
1 / 1.105 | 2 / 1.224 | 3 / 1.253 | 4 / 1.261 | 5 / 1.261 | |
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 | probportfolio [MIPLIB] | neos-911970 [MIPLIB] | 10teams [MIPLIB] | air04 [MIPLIB] | air05 [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.
|
309 / 1.811 | 499 / 1.908 | 595 / 1.983 | 950 / 2.890 | 959 / 3.032 | |
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 uct-subprob, the five most similar instances to uct-subprob according to the MIC, and the five most similar instances to uct-subprob according to MIPLIB 2017.
INSTANCE | SUBMITTER | DESCRIPTION | ISS | RANK | |
---|---|---|---|---|---|
Parent Instance | uct-subprob [MIPLIB] | Gerald Lach | Subproblem of a university course timetabling problem. Switched to "easy" because it was solved by Gurobi 5.0 in 2106 seconds (May 2012). | 0.000000 | - |
MIC Top 5 | icir97_potential [MIPLIB] | MIPLIB submission pool | Imported from the MIPLIB2010 submissions. | 1.104817 | 1 |
shiftreg5-1 [MIPLIB] | Domenico Salvagnin | Multi-activity shift scheduling problem with 5 activities and 24 employees, using an implicit model based on a regular language. | 1.224407 | 2 | |
rd-rplusc-21 [MIPLIB] | MIPLIB submission pool | Imported from the MIPLIB2010 submissions. | 1.252903 | 3 | |
neos-3611447-jijia [MIPLIB] | Jeff Linderoth | (None provided) | 1.261265 | 4 | |
neos-950242 [MIPLIB] | NEOS Server Submission | Imported from the MIPLIB2010 submissions. | 1.261389 | 5 | |
MIPLIB Top 5 | probportfolio [MIPLIB] | Feng Qiu | Sample average approximation formulation of a probabilistic portfolio optimization problem. Solved using ug[SCIP/spx], a distributed massively parallel version of SCIP run on 2,000 cores at the HLRN-II super computer facility. | 1.811285 | 309 |
neos-911970 [MIPLIB] | NEOS Server Submission | Imported from the MIPLIB2010 submissions. | 1.908098 | 499 | |
10teams [MIPLIB] | MIPLIB submission pool | Imported from the MIPLIB2010 submissions. | 1.983480 | 595 | |
air04 [MIPLIB] | G. Astfalk | Airline crew scheduling set partitioning problem | 2.890471 | 950 | |
air05 [MIPLIB] | G. Astfalk | Airline crew scheduling set partitioning problem | 3.031565 | 959 |
uct-subprob: 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 | hypothyroid | scp | neos-pseudoapplication-54 | stein | neos-pseudoapplication-91 | |
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.695 | 2 / 1.740 | 3 / 1.879 | 4 / 1.883 | 5 / 1.912 |
Model Group Summary
The table below contains summary information for the five most similar model groups to uct-subprob according to the MIC.
MODEL GROUP | SUBMITTER | DESCRIPTION | ISS | RANK | |
---|---|---|---|---|---|
MIC Top 5 | hypothyroid | Gleb Belov | Linearized Constraint Programming models of the MiniZinc Challenges 2012-2016. I should be able to produce versions with indicator constraints supported by Gurobi and CPLEX, however don't know if you can use them and if there is a standard format. These MPS were produced by Gurobi 7.0.2 using the MiniZinc develop branch on eb536656062ca13325a96b5d0881742c7d0e3c38 | 1.695373 | 1 |
scp | Shunji Umetani | This is a random test model 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 models. We have also generated reduced models 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 model generator program from the following web site. https://sites.google.com/site/shunjiumetani/benchmark | 1.739613 | 2 | |
neos-pseudoapplication-54 | Jeff Linderoth | (None provided) | 1.879397 | 3 | |
stein | MIPLIB submission pool | Imported from the MIPLIB2010 submissions. | 1.883050 | 4 | |
neos-pseudoapplication-91 | Jeff Linderoth | (None provided) | 1.911998 | 5 |