Topologie et routage dans les réseaux de communications

One of the algorithmic challenge of the synthesis of communications net-works, such as satellite constellation systems or some type of optical networks, lies in the optimal assignment of links and routes satisfying a traffic demand between several origin-destination pairs of the network. We consider here the case where the establishments of connections is defined through a visibility matrix. The modelling of this problem leads to a multirouting problem with linear costs and mixed-0-1 variables. The aim of this work is to solve exactly this problem using the Benders decomposition method, allowing a separation of the routing and the topology problem.