The network redesign problem for access telecommunications networks

DOI<487::AID-NAV3>3.0.CO;2-B 10.1002/(SICI)1520-6750(199908)46:5<487::AID-NAV3>3.0.CO;2-BzbMath0948.90027OpenAlexW1967584179MaRDI QIDQ4266755

Hanan Luss, Linos F. Frantzeskakis

Publication date: 22 September 1999

Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199908)46:5<487::aid-nav3>3.0.co;2-b

zbMATH Keywords

network flow problemheuristicmixed integer programnetwork redesign problem

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items

Multi-period traffic routing in satellite networks, A splitter location-allocation problem in designing fiber optic access networks, Developing concurrent investment plans for power generation and transmission

Cites Work

• Unnamed Item
• Models for planning capacity expansion in local access telecommunication networks
• Topological design of telecommunication networks --- local access design methods
• Multifacility-Type Capacity Expansion Planning: Algorithms and Complexities
• A Capacity Improvement Lower Bound for Fixed Charge Network Design Problems
• Networks synthesis and optimum network design problems: Models, solution methods and applications
• Operations Research and Capacity Expansion Problems: A Survey
• Backbone Network Design Tools with Economic Tradeoffs
• Heuristic Methods for Solving Large Scale Network Routing Problems: The Telpaking Problem
• A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning
• Modeling and Solving the Two-Facility Capacitated Network Loading Problem
• The One-Terminal TELPAK Problem
• Minimum cost routing for static network models