Sparsity pattern

gmut-77-40

Namegmut-77-40
Downloadgmut-77-40.mps.gz
Solutiongmut-77-40.sol.gz
Set Membership Challenge
Problem StatusHard
Problem FeasibilityFeasible
Originator/ContributorN. Konnyu
Rows2554
Cols24338
Num. non-zeros in A159902
Num. non-zeros in c12848
Rows/Cols0.104938778864
Integers
Binaries24332
Continuous6
min nonzero |Aij|0.95
max |Aij|6064.613
min nonzero |cj|2659.124
max |cj|292394.5
Integer Objective-14172045.4419852
LP Objective-14173396.636852
Aggregation
Variable Bound25
Set partitioning
Set packing2522
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Mixed 0/17
General Cons.
References

Timber harvest scheduling model. Solved by ParaXpress in a 12288 core supercomputer run on HLRN III.


Last Update July 31, 2019 by Gerald Gamrath
© 2019 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint