comp08-2idx

decomposition benchmark_suitable precedence variable_bound set_packing cardinality invariant_knapsack mixed_binary general_linear

Submitter Variables Constraints Density Status Group Objective MPS File
Matias Sørensen 11554 12536 3.56308e-04 easy coursetimetabling 37 comp08-2idx.mps.gz

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.

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 11554 11395
Constraints 12536 12459
Binaries 11487 11328
Integers 67 67
Continuous 0 0
Implicit Integers 0 0
Fixed Variables 0 0
Nonzero Density 0.000356308 0.000361977
Nonzeroes 51608 51390
Constraint Classification Properties
Original Presolved
Total 12536 12459
Empty 0 0
Free 0 0
Singleton 35 0
Aggregations 0 0
Precedence 7941 7904
Variable Bound 2355 2355
Set Partitioning 0 0
Set Packing 0 2
Set Covering 388 0
Cardinality 86 86
Invariant Knapsack 611 2041
Equation Knapsack 0 0
Bin Packing 0 0
Knapsack 0 0
Integer Knapsack 0 0
Mixed Binary 1053 4
General Linear 67 67
Indicator 0 0

Structure

Available nonzero structure and decomposition information. Further information can be found here.

value min median mean max
Components 2.515874
Constraint % 0.0080300 0.253602 0.120395 1.67750
Variable % 0.0175516 0.265850 0.131637 1.46556
Score 0.823753

Best Known Solution(s)

Find solutions below. Download the archive containing all solutions from the Download page.

ID Objective Exact Int. Viol Cons. Viol Obj. Viol Submitter Date Description
1 37 37 0 0 0 - 2018-10-10 Solution found during MIPLIB2017 problem selection.

Similar instances in collection

The following instances are most similar to comp08-2idx in the collection. This similarity analysis is based on 100 scaled instance features describing properties of the variables, objective function, bounds, constraints, and right hand sides.

Instance Status Variables Binaries Integers Continuous Constraints Nonz. Submitter Group Objective Tags
comp07-2idx easy 17264 17155 109 0 21235 86577 Matias Sørensen coursetimetabling 6 benchmark decomposition benchmark_suitable precedence variable_bound set_packing cardinality invariant_knapsack mixed_binary general_linear
comp21-2idx hard 10863 10792 71 0 14038 57301 Matias Sørensen coursetimetabling 74 benchmark decomposition benchmark_suitable precedence variable_bound set_partitioning cardinality invariant_knapsack mixed_binary general_linear
comp12-2idx open 11863 11820 43 0 16803 73677 Matias Sørensen coursetimetabling 391* decomposition precedence variable_bound set_partitioning cardinality invariant_knapsack mixed_binary general_linear
neos-983171 easy 8965 6557 0 2408 6711 36691 NEOS Server Submission neos-pseudoapplication-34 2360 benchmark_suitable precedence variable_bound set_packing invariant_knapsack integer_knapsack mixed_binary general_linear
gus-sch easy 5475 2736 2736 3 5984 33135 Alexandra M. Newman -1167 decomposition aggregations precedence variable_bound set_packing set_covering cardinality invariant_knapsack integer_knapsack mixed_binary general_linear

Reference

ITC2007 webpage: www.cs.qub.ac.uk/itc2007/

Model reference: @Article{Lach2012,
author="Lach, Gerald
and L{\"u}bbecke, Marco E.",
title="Curriculum based course timetabling: new solutions to Udine benchmark instances",
journal="Annals of Operations Research",
year="2012",
volume="194",
number="1",
pages="255--272",
abstract="We present an integer programming approach to the university course timetabling problem, in which weekly lectures have to be scheduled and assigned to rooms. Students' curricula impose restrictions as to which courses may not be scheduled in parallel. Besides some hard constraints (no two courses in the same room at the same time, etc.), there are several soft constraints in practice which give a convenient structure to timetables; these should be met as well as possible.",
issn="1572-9338",
doi="10.1007/s10479-010-0700-7",
url="http://dx.doi.org/10.1007/s10479-010-0700-7"
}

Last Update Mär 19, 2019 by Gregor Hendel
generated with R Markdown
© 2019 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint