Optimal placement of add /drop multiplexers static and dynamic models
暂无分享,去创建一个
We study further a problem that has arisen recently in the design of telecommunications transmission networks at France Telecom. Given a set of centers in a city of conglomeration linked together on a ring architecture, given the expected demands between the centers and an essentially unlimited availability of rings of fixed capacity on the network, assign demand pairs and corresponding add/drop multiplexers to the rings so as to satisfy the demands and minimize the number of "costly· multiplexers installed.
[1] Thomas L. Magnanti,et al. Shortest paths, single origin-destination network design, and associated polyhedra , 1993, Networks.
[2] Laurence A. Wolsey,et al. Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms , 1998, Oper. Res..
[3] Laurence A. Wolsey,et al. Integer Knapsack and Flow Covers with Divisible Coefficients: Polyhedra, optimization and Separation , 1995, Discret. Appl. Math..
[4] Thomas L. Magnanti,et al. Shortest Paths, Network Design and Associated Polyhedra , 1990 .