Sparsity pattern

dfn-gwin-UUM

Namedfn-gwin-UUM
Downloaddfn-gwin-UUM.mps.gz
Solutiondfn-gwin-UUM.sol.gz
Set Membership Benchmark
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorC. Raack
Rows158
Cols938
Num. non-zeros in A2632
Num. non-zeros in c91
Rows/Cols0.168443496802
Integers90
Binaries
Continuous848
min nonzero |Aij|1
max |Aij|622
min nonzero |cj|716
max |cj|8412
Integer Objective38752
LP Objective27467.257235
Aggregation1
Variable Bound
Set partitioning
Set packing
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Mixed 0/1111
General Cons.45
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