Sparsity pattern

msc98-ip

Namemsc98-ip
Downloadmsc98-ip.mps.gz
OrginatorE-Plus, Roland Wessaely
FormulatorAndreas Bley
DonatorAndreas Bley
Rows15850
Cols21143
Non-zeros92918
Integers53
Binaries20237
Continuous
|Min|7.81250000e-03
|Max|2.33453000e+06
Integer Objective19839497.005874
LP Objective1.95209662e+07
Root LP Basismsc98-ip.bas.gz
Set partitioning1110
Set packing773
Set covering4360
Cardinality3168
Equality Knapsacks
Bin packing
Invariant Knapsack851
Knapsacks473
Integer Knapsack218
Upper bounds
Lower bounds828
Mixed 0/14069
General Cons.
References BleyKoch2002 Vazacopoulos2006

Min-cost network dimensioning problem 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

The Model includes binary variables for the link capacities, (artificial and superfluous) continuous variables for the directed link flows, binary variables for the end-to-end routing paths for all demands and failure szenarios, various capacity and budget constraints, rank and other inequalities that describe those path configurations that are unsplittable shortest path routings (for some routing weights), capacity installation cost and (for perturbation purposes) flow cost on path variables.

Alkis Vazacopoulos reports solving this instance using XPRESS 2006B.


Last Update : 2010/06/09 13:56:11 $ by Gerald Gamrath
© 2010 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint