Sparsity pattern

opm2-z12-s7

Nameopm2-z12-s7
Downloadopm2-z12-s7.mps.gz
Solutionopm2-z12-s7.sol.gz
Set Membership Challenge Reoptimize
Problem StatusHard
Problem FeasibilityFeasible
Originator/ContributorD. Espinoza
Rows319508
Cols10800
Num. non-zeros in A725385
Num. non-zeros in c10742
Rows/Cols29.5840740741
Integers
Binaries10800
Continuous
min nonzero |Aij|1
max |Aij|4094
min nonzero |cj|1
max |cj|574
Integer Objective-65514
LP Objective-90514.285842
Aggregation
Variable Bound319500
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 72492 seconds (January 2012).


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