Sparsity pattern

ivu52

Nameivu52
Downloadivu52.mps.gz
Solutionivu52.sol.gz
Set Membership Challenge Reoptimize
Problem StatusHard
Problem FeasibilityFeasible
Originator/ContributorS. Weider
Rows2116
Cols157591
Num. non-zeros in A2179476
Num. non-zeros in c157591
Rows/Cols0.0134271627187
Integers
Binaries157591
Continuous
min nonzero |Aij|0.002666667
max |Aij|9
min nonzero |cj|1.581
max |cj|8
Integer Objective481.0068
LP Objective480.250438
Aggregation
Variable Bound
Set partitioning2110
Set packing
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack1
Knapsacks1
Integer Knapsack
Mixed 0/14
General Cons.
References BorndoerferLoebelWeider2008 Weider2007

Set partitioning instance resulting from a column generation algorithm used for duty scheduling in public transportation. Solved in June 2014 using CPLEX 12.6 with 48 threads in about 25 days.


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