Lagrangian decompositions for the two-level FTTx network design problem

DOI10.1007/s13675-013-0014-zzbMath1296.90099OpenAlexW2141853519MaRDI QIDQ743641

Olaf Maurer, Ivana Ljubić, Andreas Bley

Publication date: 30 September 2014

Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13675-013-0014-z

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (8)

Single PON network design with unconstrained splitting stages ⋮ Benders decomposition of the passive optical network design problem ⋮ A branch-and-cut algorithm for the routing and spectrum allocation problem ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ Design of fiber cable tree FTTH networks ⋮ Fiber cable network design in tree networks ⋮ Towards optimizing the deployment of optical access networks ⋮ The incremental connected facility location problem

Uses Software

• ConicBundle
• Netsoft

Cites Work

• Unnamed Item
• A splitter location-allocation problem in designing fiber optic access networks
• Branch-and-cut-and-price for capacitated connected facility location
• MIP models for connected facility location: a theoretical and computational study
• On implementing the push-relabel method for the maximum flow problem
• A spectral bundle method with bounds
• Optimizing splitter and fiber location in a multilevel optical FTTH network
• Connected facility location via random facility sampling and core detouring
• Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities
• Towards optimizing the deployment of optical access networks
• An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
• Exact approaches to the single-source network loading problem
• Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem
• A faster approximation algorithm for the Steiner problem in graphs

This page was built for publication: Lagrangian decompositions for the two-level FTTx network design problem