Sparsity pattern

gmut-75-50

Namegmut-75-50
Downloadgmut-75-50.mps.gz
Solutiongmut-75-50.sol.gz
Set Membership Challenge
Problem StatusOpen
Problem FeasibilityFeasible
Originator/ContributorN. Konnyu
Rows2565
Cols68865
Num. non-zeros in A571475
Num. non-zeros in c35909
Rows/Cols0.0372467871923
Integers
Binaries68859
Continuous6
min nonzero |Aij|0.95
max |Aij|7718.262
min nonzero |cj|2675.149
max |cj|373830
Integer Objective-14180699.047
LP Objective-14182312.661731
Aggregation
Variable Bound18
Set partitioning
Set packing2540
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 February 28, 2017 by Gerald Gamrath
© 2017 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint