Transmission facility planning in telecommunications networks: A heuristic approach

DOI10.1016/0377-2217(84)90314-XzbMath0531.90032OpenAlexW1988808411MaRDI QIDQ788618

N. E. Zubov

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1016/0377-2217(84)90314-x

zbMATH Keywords

decompositioncommunications networksheuristic procedureapproximate optimal solutionscircuit assignmentfacility installationfixed charge partfixed planning horizonlinear cost parttransmission system cost functions

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Mixed integer programming (90C11) Deterministic network models in operations research (90B10)

Related Items (3)

Design of private backbone networks. I: Time varying traffic ⋮ Heuristic methods and applications: A categorized survey ⋮ A comprehensive simplex-like algorithm for network optimization and perturbation analysis

Uses Software

• LINDO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Facility location models for planning a transatlantic communications network
• Parallel concepts in graph theory
• A linear programming model for design of communications networks with time varying probabilistic demands
• Operations Research and Capacity Expansion Problems: A Survey
• Optimal Network Capacity Planning: A Shortest-Path Scheme
• A Heuristic Branch-and-Bound Algorithm for Telephone Feeder Capacity Expansion
• On building minimum cost communication networks over time
• Minimum cost routing for dynamic network models

This page was built for publication: Transmission facility planning in telecommunications networks: A heuristic approach