A branch-and-cut approach for minimum cost multi-level network design
From MaRDI portal
Publication:5957748
DOI10.1016/S0012-365X(00)00404-0zbMath1014.68010MaRDI QIDQ5957748
Publication date: 3 July 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (4)
A branch and cut algorithm for the hierarchical network design problem ⋮ Optimal design of hierarchical networks with free main path extremes ⋮ Optimal hierarchical system of a grid road network ⋮ Towards optimizing the deployment of optical access networks
This page was built for publication: A branch-and-cut approach for minimum cost multi-level network design
