The Problem is a min-cost network dimensioning with

    * finite sets of link capacities
    * unsplittable flow routing

The LP contains

    * binary variables for link capacities
    * cost for link capacities
    * capacity constraints
    * binary arc-flow variables and flow conservation constraints for each commodity
    * various unsplittable shortest path routing related inequalities