×
rwth-timetable: Instance-to-Instance Comparison Results
Type: | Instance |
Submitter: | Gerald Lach |
Description: | University Course Timetabling from the RWTH Aachen |
MIPLIB Entry |
Parent Instance (rwth-timetable)
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 | nh97_tension [MIPLIB] | lectsched-4-obj [MIPLIB] | tpl-tub-ws1617 [MIPLIB] | n2seq36q [MIPLIB] | toll-like [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.224 | 2 / 1.260 | 3 / 1.276 | 4 / 1.338 | 5 / 1.342 | |
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 | nursesched-medium04 [MIPLIB] | nursesched-sprint02 [MIPLIB] | savsched1 [MIPLIB] | neos-933966 [MIPLIB] | neos-498623 [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.
|
205 / 1.861 | 247 / 1.893 | 722 / 2.129 | 783 / 2.209 | 940 / 2.666 | |
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 rwth-timetable, the five most similar instances to rwth-timetable according to the MIC, and the five most similar instances to rwth-timetable according to MIPLIB 2017.
INSTANCE | SUBMITTER | DESCRIPTION | ISS | RANK | |
---|---|---|---|---|---|
Parent Instance | rwth-timetable [MIPLIB] | Gerald Lach | University Course Timetabling from the RWTH Aachen | 0.000000 | - |
MIC Top 5 | nh97_tension [MIPLIB] | MIPLIB submission pool | Imported from the MIPLIB2010 submissions. | 1.223736 | 1 |
lectsched-4-obj [MIPLIB] | Harald Schilly | University lecture scheduling instance | 1.259521 | 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.276094 | 3 | |
n2seq36q [MIPLIB] | R. Meirich | Static line planning models on the Dutch IC network | 1.337524 | 4 | |
toll-like [MIPLIB] | Falk Hueffner | The NP-hard Balanced Subgraph problem (variant of MaxCut) encoded as ILPs. Real-world instances from two applications from bioinformatics, finding monotone subsystems in gene regulatory networks (http://dx.doi.org/10.1007/s10878-009-9212-2) and finding optimal layouts of tanglegrams (http://dx.doi.org/10.1007/978-3-642-11269-0). Solved by Gurobi 4.6 (8 threads) in about four days after a variable transformation reducing symmetry. | 1.342334 | 5 | |
MIPLIB Top 5 | nursesched-medium04 [MIPLIB] | Haroldo Gambini Santos | Nurse Scheduling Problems from the First International Nurse Rostering Competition - INRC 2010 | 1.861397 | 205 |
nursesched-sprint02 [MIPLIB] | Haroldo Gambini Santos | Nurse Scheduling Problems from the First International Nurse Rostering Competition - INRC 2010 | 1.892968 | 247 | |
savsched1 [MIPLIB] | Gerardo Gonzalez | Imported from the MIPLIB2010 submissions. | 2.129333 | 722 | |
neos-933966 [MIPLIB] | NEOS Server Submission | Instance coming from the NEOS Server with unknown application | 2.208957 | 783 | |
neos-498623 [MIPLIB] | NEOS Server Submission | Imported from the MIPLIB2010 submissions. | 2.666292 | 940 |
rwth-timetable: 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 | scp | markshare | huefner | stein | cryptanalysis | |
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.647 | 2 / 1.722 | 3 / 1.729 | 4 / 1.787 | 5 / 1.825 |
Model Group Summary
The table below contains summary information for the five most similar model groups to rwth-timetable according to the MIC.
MODEL GROUP | SUBMITTER | DESCRIPTION | ISS | RANK | |
---|---|---|---|---|---|
MIC Top 5 | 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.647349 | 1 |
markshare | G. Cornuéjols, M. Dawande | Market sharing problem | 1.722203 | 2 | |
huefner | Falk Hueffner | The NP-hard Balanced Subgraph problem (variant of MaxCut) encoded as ILPs. Real-world models from two applications from bioinformatics, finding monotone subsystems in gene regulatory networks (http://dx.doi.org/10.1007/s10878-009-9212-2) and finding optimal layouts of tanglegrams (http://dx.doi.org/10.1007/978-3-642-11269-0). | 1.729060 | 3 | |
stein | MIPLIB submission pool | Imported from the MIPLIB2010 submissions. | 1.786895 | 4 | |
cryptanalysis | 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.824806 | 5 |