×
![]()
timetabling
| Type: | Model Group |
| Submitter: | George Fonseca |
| Description: | Educational timetabling problems from several real schools/universities around the world. These models were originally expressed in the xhstt file format [1] and formulated as Integer Programming models as described at [2]. |
Parent Model Group (timetabling)
All other model groups below were be compared against this "query" model group.  |
 |
|
Model Group Composite (MGC) image
Composite of the decomposed CCM images for every instance in the query model group.
|
Component Instances (Decomposed)
These are the decomposed CCM images for each instance in the query model group. |
These are component instance images.
|
 |
 |
 |
 |
 |
| Name | brazil3 | woodlands09 | kosova1 | highschool1-aigio |
MIC Top 5 Model Groups
These are the 5 MGC images that are most similar to the MGC image for the query model group, according to the ISS metric. |
FIXME - These are model group composite images.
|
 |
 |
 |
 |
 |
| Name | f2gap | independentset | generated | pb- | neos-pseudoapplication-101 | |
|
Rank / ISS
The image-based structural similarity (ISS) metric measures the Euclidean distance between the image-based feature vectors for the query model group and all other model groups. A smaller ISS value indicates greater similarity.
|
1 / 1.898 | 2 / 1.981 | 3 / 1.989 | 4 / 1.998 | 5 / 2.000 |
Model Group Summary
The table below contains summary information for timetabling, and for the five most similar model groups to timetabling according to the MIC.
| MODEL GROUP | SUBMITTER | DESCRIPTION | ISS | RANK | |
|---|---|---|---|---|---|
| Parent Model Group | timetabling | George Fonseca | Educational timetabling problems from several real schools/universities around the world. These models were originally expressed in the xhstt file format [1] and formulated as Integer Programming models as described at [2]. | 0.000000 | - |
| MIC Top 5 | f2gap | Salim Haddadi | Restrictions of well-known hard generalized assignment problem models (D10400,D20400,D40400,D15900,D30900,D60900,D201600,D401600,D801600) | 1.897803 | 1 |
| independentset | Toni Sorrell | These models are based on Neil Sloane's Challenge problems: Independent Sets in Graphs. | 1.981205 | 2 | |
| 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. | 1.989003 | 3 | |
| pb- | Gleb Belov | These are the models from MiniZinc Challenges 2012-2016 (see www.minizinc.org), compiled for MIP WITH INDICATOR CONSTRAINTS using the develop branch of MiniZinc and CPLEX 12.7.1 on 30 April 2017. Thus, these models can only be handled by solvers accepting indicator constraints. For models compiled with big-M/domain decomposition only, see my previous submission to MIPLIB.To recompile, create a directory MODELS, a list lst12_16.txt of the models with full paths to mzn/dzn files of each model per line, and say$> ~/install/libmzn/tests/benchmarking/mzn-test.py -l ../lst12_16.txt -slvPrf MZN-CPLEX -debug 1 -addOption "-timeout 3 -D fIndConstr=true -D fMIPdomains=false" -useJoinedName "-writeModel MODELS_IND/%s.mps" Alternatively, you can compile individual model as follows: $> mzn-cplex -v -s -G linear -output-time ../challenge_2012_2016/mznc2016_probs/zephyrus/zephyrus.mzn ../challenge_2012_2016/mznc2016_p/zephyrus/14__8__6__3.dzn -a -timeout 3 -D fIndConstr=true -D fMIPdomains=false -writeModel MODELS_IND/challenge_2012_2016mznc2016_probszephyruszephyrusmzn-challenge_2012_2016mznc2016_probszephyrus14__8__6__3dzn.mps | 1.998077 | 4 | |
| 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.000213 | 5 |
