A comparison of optimal methods for local access uncapacitated network design
From MaRDI portal
Publication:1599315
DOI10.1023/A:1014569927266zbMath1015.90014OpenAlexW32339595MaRDI QIDQ1599315
C. D. Randazzo, Henrigue Pacca Loureiro Luna
Publication date: 9 June 2002
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1014569927266
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Decomposition methods (49M27)
Related Items (11)
Hub location problems with price sensitive demands ⋮ Multiple allocation hub-and-spoke network design under hub congestion ⋮ Decomposition based hybrid metaheuristics ⋮ Optimizing splitter and fiber location in a multilevel optical FTTH network ⋮ Tree network design avoiding congestion ⋮ Benders decomposition for the uncapacitated multiple allocation hub location problem ⋮ Lower and upper bounds for a two-level hierarchical location problem in computer networks ⋮ Solving the optimum communication spanning tree problem ⋮ A survey on Benders decomposition applied to fixed-charge network design problems ⋮ Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design ⋮ Towards optimizing the deployment of optical access networks
This page was built for publication: A comparison of optimal methods for local access uncapacitated network design
