Sparsity pattern

opm2-z11-s8

Nameopm2-z11-s8
Downloadopm2-z11-s8.mps.gz
Solutionopm2-z11-s8.sol.gz
Set Membership Challenge Reoptimize
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorD. Espinoza
Rows223082
Cols8019
Num. non-zeros in A510283
Num. non-zeros in c7959
Rows/Cols27.8191794488
Integers
Binaries8019
Continuous
min nonzero |Aij|1
max |Aij|4094
min nonzero |cj|1
max |cj|526
Integer Objective-43485
LP Objective-62971.930395
Aggregation
Variable Bound223074
Set partitioning
Set packing
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks8
Integer Knapsack
Mixed 0/1
General Cons.
References

Problem coming from precedence constrained knapsacks arising in mining applications. Solved by Gurobi 4.6.1 (12 threads) in 18286 seconds (January 2012).


Last Update December 6, 2016 by Gerald Gamrath
© 2016 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint