𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Genetic algorithm for planning cable telecommunication networks

✍ Scribed by Pablo Cortés; Juan Larrañeta; Luis Onieva; José M. Garcı́a; Marı́a S. Caraballo

Book ID
108497141
Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
325 KB
Volume
1
Category
Article
ISSN
1568-4946

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Problems in using computers for planning
Problems in using computers for planning telecommunications networks
✍ I.F. Galpin 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 208 KB

Telecommunications networks possess special properties which make it difficult to use standard network analysis techniques: for example, Kirchhoff's Laws do not apply. Some of the problems arising are discussed with reference to the planning of the network of cables and radio links interconnecting t

A new proximal decomposition algorithm f
A new proximal decomposition algorithm for routing in telecommunication networks
✍ Mahey, P.; Ouorou, A.; LeBlanc, L.; Chifflet, J. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB 👁 2 views

We present a new and much more efficient implementation of the proximal decomposition algorithm for routing in congested telecommunication networks. The routing model that we analyze is a static one intended for use as a subproblem in a network design context. After describing our new implementation