Towards optimizing the deployment of optical access networks
From MaRDI portal
Publication:2513732
DOI10.1007/S13675-013-0016-XzbMath1305.90097OpenAlexW2167963257MaRDI QIDQ2513732
Christian Raack, Axel Werner, Martin Grötschel
Publication date: 28 January 2015
Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13675-013-0016-x
network designtelecommunicationsroutingenergy efficiencyaccess networkspassive optical networksFTTBFTTCFTTHFTTNFTTx
Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Communication networks in operations research (90B18) Discrete location and assignment (90B80)
Related Items (9)
Optimal capacitated ring trees ⋮ Exact algorithms for bi-objective ring tree problems with reliability measures ⋮ ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ Telecommunications network design: Technology impacts and future directions ⋮ Design of fiber cable tree FTTH networks ⋮ Fiber cable network design in tree networks ⋮ Lagrangian decompositions for the two-level FTTx network design problem ⋮ Comments on: ``Static and dynamic source locations in undirected networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Lagrangian decompositions for the two-level FTTx network design problem
- Models for planning capacity expansion in local access telecommunication networks
- A comparison of heuristics and relaxations for the capacitated plant location problem
- The hierarchical network design problem
- Source sink flows with capacity installation in batches
- The hierarchical network design problem with transshipment facilities
- Topological design of telecommunication networks --- local access design methods
- Solving to optimality the uncapacitated fixed-charge network flow problem
- The Steiner tree problem with hop constraints
- The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
- The Steiner tree problem. II: Properties and classes of facets
- A polyhedral approach to multicommodity survivable network design
- The capacitated plant location problem
- A branch-and-bound algorithm to solve a multi-level network optimization problem
- Hybrid fiber co-axial CATV network design with variable capacity optical network units
- New modeling approaches for the design of local access transport area networks
- A dynamic programming algorithm for the local access telecommunication network expansion problem
- Node placement and sizing for copper broadband access networks
- A comparison of optimal methods for local access uncapacitated network design
- Concentrator location in telecommunications networks.
- General network design: a unified view of combined location and network design problems
- Optimizing splitter and fiber location in a multilevel optical FTTH network
- Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities
- A cutting plane algorithm for the capacitated connected facility location problem
- Metric inequalities and the network loading problem
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- Exact approaches to the single-source network loading problem
- Solving the Capacitated Local Access Network Design Problem
- A Direct Connection Approach to Integrated Line Planning and Passenger Routing
- On cut-based inequalities for capacitated network design polyhedra
- MIP Modeling of Incremental Connected Facility Location
- Combined Network Design and Multiperiod Pricing: Modeling, Solution Techniques, and Computation
- Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems
- Hybrid Fiber Coaxial Network Design
- A Dual-Based Algorithm for Multi-Level Network Design
- Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem
- Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
- The Ring Star Problem: Polyhedral analysis and exact algorithm
- Solving Steiner tree problems in graphs to optimality
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
- Lower Bounding Procedures for Multiperiod Telecommunications Network Expansion Problems
- A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- Provisioning a virtual private network
- Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
- The Line Connectivity Problem
- Solving the hub location problem in a star–star network
- Capacitated Network Design—Polyhedral Structure and Computation
- A branch-and-cut approach for minimum cost multi-level network design
- Steiner tree problems
This page was built for publication: Towards optimizing the deployment of optical access networks
