Sparsity pattern

bg512142

Namebg512142
Downloadbg512142.mps.gz
Solutionbg512142.sol.gz
Set Membership Challenge
Problem StatusHard
Problem FeasibilityFeasible
Originator/ContributorA. Miller
Rows1307
Cols792
Num. non-zeros in A3953
Num. non-zeros in c552
Rows/Cols1.65025252525
Integers
Binaries240
Continuous552
min nonzero |Aij|1
max |Aij|5621
min nonzero |cj|1
max |cj|10000
Integer Objective184202.75
LP Objective144364.073815
Aggregation4
Variable Bound274
Set partitioning
Set packing
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Mixed 0/1657
General Cons.
References AkartunaliMiller2009 FischettiGloverLodi2005 Stadtler2003

Multilevel lot-sizing instance. Three restarted runs of ug[CPLEX, MPI](ParaCPLEX) (http://ug.zib.de) solved this instance on alibaba cluster (http://www.zib.de/cluster-user/view) in approximately 490 hours. CPLEX 12.5 is used as a MIP solver in Ubiquity Generator framework.


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