| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 455.04 KB | Adobe PDF |
Autores
Orientador(es)
Resumo(s)
In this paper, we present a new formulation for the local access network expansion problem. Previously, we have shown that this problem can be seen as an extension of the well-known Capacitated Minimum Spanning Tree Problem and have presented and tested two flow-based models. By including additional information on the definition of the variables, we propose a new flow-based model that permits us to use effectively variable eliminations tests as well as coefficient reduction on some of the constraints. We present computational results for instances with up to 500 nodes in order to show the advantages of the new model in comparison with the others.
Descrição
Palavras-chave
Network flows Local access network Capacitated Minimum Spanning Tree Problem Valid inequalities
Contexto Educativo
Citação
CORTE-REAL, M.; GOUVEIA, Luís - A node rooted flow-based model for the local access network expansion problem. European Journal of Operational Research. ISSN 0377-2217. Vol. 204 (2010), p. 20–34
Editora
Elsevier