In this paper we study a network design problem arising in the management of a carrier network. The aim is to route a traffic matrix, minimizing a measure of the… Click to show full abstract
In this paper we study a network design problem arising in the management of a carrier network. The aim is to route a traffic matrix, minimizing a measure of the network congestion while guaranteeing a prescribed quality of service. We formulate the problem, devise presolve procedures to reduce the size of the corresponding mixed‐integer programming formulation and show that the proposed approach can efficiently solve some real‐life problems, leading to an improvement with respect to the current practice in a real case study.
               
Click one of the above tabs to view related content.