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

DOI10.1287/OPRE.27.3.567zbMATH Open0403.90086OpenAlexW2061435904MaRDI QIDQ4189077FDOQ4189077

Authors: John Freidenfelds, C. D. McLaughlin 

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

Case StudyComputational EfficiencyHeuristic Branch-And-Bound AlgorithmTelephone Feeder Capacity ExpansionTelephonic Networks

Mathematics Subject Classification ID

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

Cited In (5)

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

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

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