Sparsity pattern

atlanta-ip

Nameatlanta-ip
Downloadatlanta-ip.mps.gz
Solutionatlanta-ip.sol.gz
Set Membership Challenge
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorE-Plus, D. Bienstock, A. Bley, R. Wessäly
Rows21732
Cols48738
Num. non-zeros in A257532
Num. non-zeros in c31296
Rows/Cols0.445894374
Integers106
Binaries46667
Continuous1965
min nonzero |Aij|0.028
max |Aij|64
min nonzero |cj|1.00002e-06
max |cj|17
Integer Objective90.009878614
LP Objective81.243199
Aggregation573
Variable Bound2293
Set partitioning782
Set packing
Set covering
Cardinality5540
Equality Knapsacks
Bin packing
Invariant Knapsack2209
Knapsacks774
Integer Knapsack1
Mixed 0/19202
General Cons.181
References BleyKoch2002

Min-cost network dimensioning problems with a finite set of link capacities for each bidirected link, unsplittable shortest path routing, path restoration for single node failures, and routing path length restrictions


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