Sparsity pattern

bienst2

Namebienst2
Downloadbienst2.mps.gz
Solutionbienst2.sol.gz
Set Membership Benchmark
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorH. Mittelmann
Rows576
Cols505
Num. non-zeros in A2184
Num. non-zeros in c1
Rows/Cols1.14059405941
Integers
Binaries35
Continuous470
min nonzero |Aij|1
max |Aij|81
min nonzero |cj|1
max |cj|1
Integer Objective54.6
LP Objective11.724138
Aggregation
Variable Bound448
Set partitioning
Set packing
Set covering
Cardinality5
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Mixed 0/1123
General Cons.
References

Relaxed version of problem bienst


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