Sparsity pattern

uct-subprob

Nameuct-subprob
Downloaduct-subprob.mps.gz
Solutionuct-subprob.sol.gz
Set Membership Challenge
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorG. Lach
Rows1973
Cols2256
Num. non-zeros in A10147
Num. non-zeros in c1345
Rows/Cols0.874556737589
Integers
Binaries379
Continuous1877
min nonzero |Aij|1
max |Aij|1
min nonzero |cj|1
max |cj|8
Integer Objective314
LP Objective242
Aggregation131
Variable Bound91
Set partitioning
Set packing6
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack6
Knapsacks
Integer Knapsack
Mixed 0/11725
General Cons.
References

Subproblem of a university course timetabling problem. Switched to "easy" because it was solved by Gurobi 5.0 in 2106 seconds (May 2012).


Last Update February 28, 2017 by Gerald Gamrath
© 2017 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint