A branch-and-bound algorithm to solve a multi-level network optimization problem
From MaRDI portal
Publication:1398020
DOI10.1023/A:1023670814370zbMath1028.90003OpenAlexW1554474890MaRDI QIDQ1398020
Frederico R. B. Cruz, Geraldo Robson Mateus, James MacGregor Smith
Publication date: 6 August 2003
Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1023670814370
location problemsnetwork designmulti-level networkstopological network designSteiner problems in graphs
Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10)
Related Items (5)
Optimizing splitter and fiber location in a multilevel optical FTTH network ⋮ Towards optimizing the deployment of optical access networks ⋮ Solving to optimality the uncapacitated fixed-charge network flow problem ⋮ A BRANCH-AND-BOUND ALGORITHM FOR A PSEUDO-BOOLEAN OPTIMIZATION PROBLEM WITH BLACK-BOX FUNCTIONS ⋮ Algorithms for a multi-level network optimization problem
This page was built for publication: A branch-and-bound algorithm to solve a multi-level network optimization problem