atlanta-ip

The Problem is a min-cost network dimensioning with

• finite set of link capacities for each bidirected link
• unsplittable shortest path routing
• (path) restoration for single node failures
• routing path length restriction
• the traffic demands and underlying network is from Danial Bienstock
• the capacity and cost data is artificial

• 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, which are not part of this LP)
• capacity installation cost and (for perturbation purposes) flow cost on path variables

Alkis Vazacopoulos reports solving this instance using XPRESS 2006B.