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

DOI10.1287/OPRE.27.3.567MaRDI QIDQ4189077zbMATH OpenOpenAlexFDO

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

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

Cited in

(5)

• Heuristics and their design: A survey
• 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
• 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

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