This article provides an overview about the main results and findings developed in the dissertation of the author [8]. In this thesis, we develop methods in mathematical optimization to dimension networks at minimal cost. Given hardware and costmodels, the challenge is to provide network topologies and efficient capacity plans that meet the demand for network traffic (data, passengers, freight).We incorporate crucial aspects of practical interest such as the discrete structure of available capacities as well as the uncertainty of demand forecasts. The considered planning problems typically arise in the strategic design of telecommunication or public transport networks and also in logistics. One of the essential aspects studied in this work is the use of cutting planes to enhance solution approaches based on multi-commodity flow formulations. Providing theoretical and computational evidence for the efficacy of inequalities based on network cuts, we extend existing theory and algorithmic work in different directions.
展开▼
