Sparsity pattern

dg012142

Namedg012142
Downloaddg012142.mps.gz
Solutiondg012142.sol.gz
Set Membership Challenge
Problem StatusHard
Problem FeasibilityFeasible
Originator/ContributorA. Miller
Rows6310
Cols2080
Num. non-zeros in A14795
Num. non-zeros in c1440
Rows/Cols3.03365384615
Integers
Binaries640
Continuous1440
min nonzero |Aij|1
max |Aij|7173
min nonzero |cj|1
max |cj|10000
Integer Objective2300867
LP Objective757818.480114
Aggregation6
Variable Bound701
Set partitioning
Set packing
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Mixed 0/11390
General Cons.
References AkartunaliMiller2009 FischettiGloverLodi2005 Stadtler2003

Multilevel lot-sizing instance This instance was solved by using 256 cores of the distributed-memory supercomputer Fujitsu PRIMERGY RX200S5 (http://www.ism.ac.jp/computer_system/eng/sc/super.html). The problem was solved by ParaSCIP in approximately 43 hours.


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