Sparsity pattern

set3-10

Nameset3-10
Downloadset3-10.mps.gz
Solutionset3-10.sol.gz
Set Membership Challenge
Problem StatusHard
Problem FeasibilityFeasible
Originator/ContributorK. Akartunali, A. Miller
Rows3747
Cols4019
Num. non-zeros in A13747
Num. non-zeros in c1
Rows/Cols0.932321473003
Integers
Binaries1424
Continuous2595
min nonzero |Aij|0.0225
max |Aij|18688.7
min nonzero |cj|1
max |cj|1
Integer Objective185179.043049708
LP Objective788.890655
Aggregation
Variable Bound1230
Set partitioning
Set packing
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Mixed 0/12517
General Cons.
References AkartunaliMiller2010 AkartunaliMiller2009 multilsb

Multi-item lot-sizing with backlogging. Solved by SCIP 3.1.1 parallelized by UG 0.7.5 linked to CPLEX 12.6 as an LP solver on HLRN III (https://www.hlrn.de/home/view/System3/CrayHardware). Due to time limit restrictions, five repeated runs, each starting from the checkpointing file of the previous run, were done. Each run had a time limit of 12 hours while using 6144 (runs 1, 3, and 4) or 3072 cores (run 2 and 5).


Last Update December 6, 2016 by Gerald Gamrath
© 2016 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint