Sparsity pattern

germany50-DBM

Namegermany50-DBM
Downloadgermany50-DBM.mps.gz
Solutiongermany50-DBM.sol.gz
Set Membership Challenge
Problem StatusHard
Problem FeasibilityFeasible
Originator/ContributorC. Raack
Rows2526
Cols8189
Num. non-zeros in A24479
Num. non-zeros in c88
Rows/Cols0.308462571743
Integers88
Binaries
Continuous8101
min nonzero |Aij|1
max |Aij|40
min nonzero |cj|3290
max |cj|4150
Integer Objective473840
LP Objective438028
Aggregation9
Variable Bound
Set partitioning
Set packing
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Mixed 0/12341
General Cons.176
References AchterbergRaack2010 RaackKosterOrlowskiWessaely2011 OrlowskiPioroTomaszewskiWessaely2010 sndlib

Network design, link dimensioning model for problem in the SNDlib. This problem was solved on ISM supercomputer Fujitsu PRIMERGY RX200S5 (http://www.ism.ac.jp/computer_system/eng/sc/index.html) by ParaSCIP in approximately 590 hours with 14 times restarted 15 jobs.


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