Sparsity pattern

opm2-z10-s2

Nameopm2-z10-s2
Downloadopm2-z10-s2.mps.gz
Solutionopm2-z10-s2.sol.gz
Set Membership Challenge
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorD. Espinoza
Rows160633
Cols6250
Num. non-zeros in A371243
Num. non-zeros in c6202
Rows/Cols25.70128
Integers
Binaries6250
Continuous
min nonzero |Aij|1
max |Aij|4094
min nonzero |cj|1
max |cj|477
Integer Objective-33826
LP Objective-49308.278601
Aggregation
Variable Bound160625
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 10131 seconds (January 2012).


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