Network flow models for the local access network expansion problem

DOI10.1016/J.COR.2005.07.001MaRDI QIDQ856692zbMATH OpenOpenAlexFDO

Authors Margarida Corte-Real, Luis 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

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

Recommendations

• A node rooted flow-based model for the local access network expansion problem
• A comparison of optimal methods for local access uncapacitated network design
• A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning
• Capacitated Network Design—Polyhedral Structure and Computation
• Solving the capacitated local access network design problem

Cites work

• scientific article; zbMATH DE number 4173002 (Why is no real title available?)
• scientific article; zbMATH DE number 1301851 (Why is no real title available?)
• scientific article; zbMATH DE number 795222 (Why is no real title available?)
• A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning
• A catalog of steiner tree formulations
• A decomposition algorithm for capacity expansion of local access networks
• A dynamic programming algorithm for the local access telecommunication network expansion problem
• An Algorithm for the Design of Multitype Concentrator Networks
• Design and Implementation of an Interactive Optimization System for Telephone Network Planning
• Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
• Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem
• Modeling and Solving the Two-Facility Capacitated Network Loading Problem
• Models for planning capacity expansion in local access telecommunication networks
• Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs

Cited in

(6)

• Equitable bandwidth allocation in content distribution networks
• Modeling the Mobile Oil Recovery Problem as a Multiobjective Vehicle Routing Problem
• A comparison of optimal methods for local access uncapacitated network design
• A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning
• A node rooted flow-based model for the local access network expansion problem
• Network expansion by adding arcs and/or nodes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856692)