Network flow models for the local access network expansion problem

DOI10.1016/J.COR.2005.07.001zbMath1102.90010OpenAlexW2115648412MaRDI QIDQ856692

Margarida Corte-Real, Luís Gouveia

Publication date: 7 December 2006

Published in: Computers \& Operations Research (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (3)

A node rooted flow-based model for the local access network expansion problem ⋮ Equitable bandwidth allocation in content distribution networks ⋮ Modeling the Mobile Oil Recovery Problem as a Multiobjective Vehicle Routing Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Models for planning capacity expansion in local access telecommunication networks
• 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
• A decomposition algorithm for capacity expansion of local access networks
• Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem
• Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
• A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning
• Modeling and Solving the Two-Facility Capacitated Network Loading Problem
• 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

This page was built for publication: Network flow models for the local access network expansion problem