๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A new optimal packing algorithm for telecommunications networks planning

โœ Scribed by Z.R. Bogdanowicz; T.G. Moore

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
326 KB
Volume
18
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

A methodology for optimal planning of ca
A methodology for optimal planning of capacitor installments in deregulated distribution networks
โœ N. Rajakovic; R. Drca; N. Arsenijevic ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 736 KB

## Abstract In this paper methodology for optimal planning of capacitor installments in deregulated distribution networks is presented. The improvements are performed by using heuristics in practical consideration, reducing the number of combinations in a special division search technique. Deregula