A node rooted flow-based model for the local access network expansion problem

DOI10.1016/j.ejor.2009.10.001zbMath1178.90054OpenAlexW2166989693MaRDI QIDQ2654316

Margarida Corte-Real, Luís Gouveia

Publication date: 15 January 2010

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://dspace.ismt.pt/xmlui/handle/123456789/350

zbMATH Keywords

network flowsvalid inequalitieslocal access networkcapacitated minimum spanning tree problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Cites Work

• Models for planning capacity expansion in local access telecommunication networks
• Heuristics for multi-period capacity expansion in local telecommunications networks
• Network flow models for the local access network expansion problem
• A dynamic programming algorithm for the local access telecommunication network expansion problem
• Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs
• Multi-period capacity expansion for a local access telecommunications network
• A decomposition algorithm for capacity expansion of local access networks
• Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
• A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning
• A catalog of steiner tree formulations
• An Algorithm for the Design of Multitype Concentrator Networks
• Design and Implementation of an Interactive Optimization System for Telephone Network Planning
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A node rooted flow-based model for the local access network expansion problem