lectsched-2

feasibility benchmark_suitable aggregations precedence variable_bound integer_knapsack general_linear

Submitter Variables Constraints Density Status Group Objective MPS File
Harald Schilly 17656 30738 3.43683e-04 easy lectsched 0 lectsched-2.mps.gz

University lecture scheduling instance

Imported from MIPLIB2010.

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
Original Presolved
Variables 17656 4814
Constraints 30738 9393
Binaries 17287 4656
Integers 369 158
Continuous 0 0
Implicit Integers 0 0
Fixed Variables 0 0
Nonzero Density 0.000343683 0.000956833
Nonzeroes 186520 43266
Constraint Classification Properties
Original Presolved
Total 30738 9393
Empty 0 0
Free 0 0
Singleton 1468 0
Aggregations 6 2
Precedence 54 28
Variable Bound 90 805
Set Partitioning 0 0
Set Packing 0 0
Set Covering 0 0
Cardinality 0 0
Invariant Knapsack 0 0
Equation Knapsack 0 0
Bin Packing 0 0
Knapsack 0 0
Integer Knapsack 2040 505
Mixed Binary 0 0
General Linear 27080 8053
Indicator 0 0

Structure

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

value min median mean max
Components 0.301030
Constraint % 100.0000 100.0000 100.0000 100.0000
Variable % 49.5303 49.5303 49.5303 49.5303
Score 0.504697

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 0 0 0 0 0 - 2018-10-12 Solution found during MIPLIB2017 problem selection.

Similar instances in collection

The following instances are most similar to lectsched-2 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
lectsched-3 easy 25776 25319 457 0 45262 279967 Harald Schilly lectsched 0 feasibility benchmark_suitable aggregations precedence variable_bound integer_knapsack general_linear
lectsched-1 easy 28718 28236 482 0 50108 310792 Harald Schilly lectsched 0 feasibility benchmark_suitable aggregations precedence variable_bound integer_knapsack general_linear
neos-3355323-arnon open 10248 10104 144 0 21216 69912 Jeff Linderoth neos-pseudoapplication-38 no_solution feasibility aggregations precedence set_covering invariant_knapsack binpacking general_linear
neos-3211096-shag hard 4379 4289 90 0 10187 31705 Jeff Linderoth neos-pseudoapplication-38 Infeasible infeasible feasibility aggregations precedence variable_bound set_covering invariant_knapsack binpacking mixed_binary general_linear
neos-3603137-hoteo open 4003 3913 90 0 10510 39146 Jeff Linderoth neos-pseudoapplication-38 no_solution feasibility aggregations set_covering invariant_knapsack knapsack general_linear

Reference

@mastersthesis{Schilly2007,
 author = {Harald Schilly},
 language = {german},
 school = {Universit{\"a}t Wien},
 title = {Modellierung und {I}mplementation eines {V}orlesungsplaners},
 type = {Diploma thesis},
 year = {2007}
}

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