Sparsity pattern

gmu-35-50

Namegmu-35-50
Downloadgmu-35-50.mps.gz
Solutiongmu-35-50.sol.gz
Set Membership Tree
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorN. Konnyu
Rows435
Cols1919
Num. non-zeros in A8643
Num. non-zeros in c1022
Rows/Cols0.226680562793
Integers
Binaries1914
Continuous5
min nonzero |Aij|0.8
max |Aij|2574.305
min nonzero |cj|2694.614
max |cj|232602
Integer Objective-2607958.33
LP Objective-2608070.315743
Aggregation
Variable Bound16
Set partitioning
Set packing406
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Mixed 0/113
General Cons.
References

Timber harvest scheduling model


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