This paper deals with the so called grouping problem which arises in telecommunication network optimization when transmission equipment with a certain hierarchy is used. It is shown how this problem is embedded in the complete scheme of network optimization and a general combinatorial model is developed to derive afterwards a solution procedure. The implementation of this procedure forms part of a software tool for the complete problem of transmission network planning. Some results deriving from practical examples and further extensions are indicated.
@article{urn:eudml:doc:40331,
title = {A model and an algorithm for the grouping problem in telecom networks.},
journal = {Q\"uestii\'o},
volume = {15},
year = {1991},
pages = {177-197},
zbl = {1167.90393},
language = {en},
url = {http://dml.mathdoc.fr/item/urn:eudml:doc:40331}
}
García, F.; Hackbarth, K. D. A model and an algorithm for the grouping problem in telecom networks.. Qüestiió, Tome 15 (1991) pp. 177-197. http://gdmltest.u-ga.fr/item/urn:eudml:doc:40331/