| Name | germany50-DBM |
| Download | germany50-DBM.mps.gz |
| Set Membership | Challenge |
| Problem Status | Open |
| Problem Feasibility | Feasible |
| Originator/Contributor | C. Raack |
| Rows | 2526 |
| Cols | 8189 |
| Num. non-zeros in A | 24479 |
| Num. non-zeros in c | 88 |
| Rows/Cols | 0.308462571743 |
| Integers | 88 |
| Binaries | |
| Continuous | 8101 |
| min nonzero |Aij| | 1 |
| max |Aij| | 40 |
| min nonzero |cj| | 3290 |
| max |cj| | 4150 |
| Integer Objective | Unknown |
| LP Objective | 438028 |
| Aggregation | 9 |
| Variable Bound | |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 2341 |
| General Cons. | 176 |
| References | AchterbergRaack2010 RaackKosterOrlowskiWessaely2011 OrlowskiPioroTomaszewskiWessaely2010 sndlib |
Network design, link dimensioning model for problem in the SNDlib