Sparsity pattern

nobel-eu-DBE

Namenobel-eu-DBE
Downloadnobel-eu-DBE.mps.gz
Solutionnobel-eu-DBE.sol.gz
Set Membership Tree
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorC. Raack
Rows879
Cols3771
Num. non-zeros in A11313
Num. non-zeros in c1639
Rows/Cols0.233094669849
Integers
Binaries1639
Continuous2132
min nonzero |Aij|1
max |Aij|77400
min nonzero |cj|3150
max |cj|3870000
Integer Objective608910
LP Objective570687.5
Aggregation9
Variable Bound
Set partitioning
Set packing
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack41
Knapsacks
Integer Knapsack
Mixed 0/1870
General Cons.
References AchterbergRaack2010 RaackKosterOrlowskiWessaely2011 OrlowskiPioroTomaszewskiWessaely2010 sndlib

Network design, link dimensioning model for problem in the SNDlib


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