caa a22 4500 475789849 CHVBK 20180406123708.0 cr unu---uuuuu 170329e20001201xx s 000 0 eng 10.1023/A:1019147029476 doi (NATIONALLICENCE)springer-10.1023/A:1019147029476 Model and heuristic for a generalized access network design problem [Elektronische Daten] [Geraldo Mateus, Raphaël Franqueira] The generalized access network design problem consists of finding a topology, capacity assignment and routing that minimize the sum of costs to connect every pair of remote unit and its central node specified by the telecommunication company. We consider an integer programming formulation with a partial multicommodity structure. We analyze some aspects and extensions of the proposed model and we introduce a heuristic based on Lagrangian relaxation and the subgradient method. We report computational results for a set of randomly generated test problems. They include networks with up to 300 nodes and show that even problem instances defined in small networks can be extremely difficult problems. The heuristic generates effective and acceptable designs from the practical point of view. We compare our heuristic with a commercial code. Kluwer Academic Publishers, 2000 Mateus Geraldo aut Franqueira Raphaël aut Telecommunication Systems Kluwer Academic Publishers 15/3-4(2000-12-01), 257-271 1018-4864 15:3-4<257 2000 15 11235 https://doi.org/10.1023/A:1019147029476 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1023/A:1019147029476 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Mateus Geraldo aut NATIONALLICENCE 700 1- Franqueira Raphaël aut NATIONALLICENCE 773 0- Telecommunication Systems Kluwer Academic Publishers 15/3-4(2000-12-01), 257-271 1018-4864 15:3-4<257 2000 15 11235 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer