|Orginator||E-Plus, Roland Wessaely|
|Root LP Basis||msc98-ip.bas.gz|
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.