Network flow models for the local access network expansion problem
| dc.contributor.author | Corte-Real, Margarida Gouveia, Luís | |
| dc.date.accessioned | 2014-02-19T19:47:15Z | |
| dc.date.available | 2014-02-19T19:47:15Z | |
| dc.date.issued | 2007 | |
| dc.description.abstract | In the local access network expansion problem we need to expand a given network (with tree topology) due to traffic demand increase. We can expand the network either by increasing the capacity of its edges and/or by installing equipments that concentrate the traffic of several demand points. This problem has received some attention in the literature. Here, we view the problem as an extension of the well-known capacitated minimum spanning tree problem. We adapt two types of flow-based formulations, aggregated and disaggregated formulations and present some valid inequalities to improve the linear programming bounds of the previous formulations. Computational results from a set of tests with 100 and 200 nodes that compare the lower bounds given by the different models, new and old, are reported. Our results demonstrate that the flow-based models are worth trying for these problems. | pt_PT |
| dc.identifier.citation | M. Corte-Real, L. Gouveia / Computers & Operations Research 34 (2007) 1141–1157 | pt_PT |
| dc.identifier.issn | 03050548 | |
| dc.identifier.uri | http://dspace.ismt.pt/xmlui/handle/123456789/349 | |
| dc.language.iso | eng | pt_PT |
| dc.peerreviewed | yes | pt_PT |
| dc.rights | openAccess | pt_PT |
| dc.subject | Network flow models | pt_PT |
| dc.subject | local access network | pt_PT |
| dc.title | Network flow models for the local access network expansion problem | pt_PT |
| dc.type | article | pt_PT |
| degois.publication.firstPage | 1141 | pt_PT |
| degois.publication.lastPage | 1157 | pt_PT |
| degois.publication.title | Computers & Operations Research | pt_PT |
| degois.publication.volume | 34 | pt_PT |