Sparsity pattern

b2c1s1

Nameb2c1s1
Downloadb2c1s1.mps.gz
Solutionb2c1s1.sol.gz
Set Membership Challenge
Problem StatusHard
Problem FeasibilityFeasible
Originator/ContributorM. Vyve, Y. Pochet
Rows3904
Cols3872
Num. non-zeros in A11408
Num. non-zeros in c1568
Rows/Cols1.00826446281
Integers
Binaries288
Continuous3584
min nonzero |Aij|0.2
max |Aij|480
min nonzero |cj|0.02
max |cj|1200
Integer Objective25687.9
LP Objective4034.218333
Aggregation16
Variable Bound2560
Set partitioning
Set packing
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Mixed 0/11328
General Cons.
References FischettiLodi2003 PochetVyve2004

Lot sizing instance. Solved by Gurobi 4.6.1 (12 threads) in 116575 seconds (January 2012).


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