A Heuristic Branch-and-Bound Algorithm for Telephone Feeder Capacity Expansion

DOI10.1287/opre.27.3.567zbMath0403.90086OpenAlexW2061435904MaRDI QIDQ4189077

C. D. McLaughlin, John Freidenfelds

Publication date: 1979

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.27.3.567

zbMATH Keywords

Computational EfficiencyCase StudyHeuristic Branch-And-Bound AlgorithmTelephone Feeder Capacity ExpansionTelephonic Networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Operations research and management science (90B99) Applications of graph theory to circuits and networks (94C15)

Related Items (5)

Heuristics and their design: A survey ⋮ Optimal timing decisions for the introduction of new technologies ⋮ Heuristic methods and applications: A categorized survey ⋮ Transmission facility planning in telecommunications networks: A heuristic approach ⋮ Models for planning capacity expansion in local access telecommunication networks

This page was built for publication: A Heuristic Branch-and-Bound Algorithm for Telephone Feeder Capacity Expansion