Sparsity pattern

msc98-ip

Namemsc98-ip
Downloadmsc98-ip.mps.gz
Solutionmsc98-ip.sol.gz
Set Membership Benchmark Reoptimize
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorE-Plus, D. Bienstock, A. Bley, R. Wessäly
Rows15850
Cols21143
Num. non-zeros in A92918
Num. non-zeros in c7440
Rows/Cols0.749657096912
Integers53
Binaries20237
Continuous853
min nonzero |Aij|0.0078125
max |Aij|2334530
min nonzero |cj|1.04154e-06
max |cj|2334530
Integer Objective19839497.005874302
LP Objective19520966.151661
Aggregation280
Variable Bound1739
Set partitioning586
Set packing
Set covering
Cardinality3331
Equality Knapsacks
Bin packing
Invariant Knapsack5210
Knapsacks473
Integer Knapsack1
Mixed 0/14069
General Cons.79
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