Sparsity pattern

gmu-35-40

Namegmu-35-40
Downloadgmu-35-40.mps.gz
Solutiongmu-35-40.sol.gz
Set Membership Benchmark Tree
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorN. Konnyu
Rows424
Cols1205
Num. non-zeros in A4843
Num. non-zeros in c687
Rows/Cols0.351867219917
Integers
Binaries1200
Continuous5
min nonzero |Aij|0.8
max |Aij|2574.305
min nonzero |cj|2694.614
max |cj|158053.2
Integer Objective-2406733.3688
LP Objective-2406943.556343
Aggregation
Variable Bound32
Set partitioning
Set packing379
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