A two-level location-allocation problem in designing local access fiber optic networks
DOI10.1016/j.cor.2014.05.005zbMath1348.90409OpenAlexW2012330203MaRDI QIDQ337111
Youngho Lee, Junghee Han, Gigyoung Park
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.05.005
mixed integer programmingaccess networksfiber optic access networksMIP-based tree partitioning heuristicreformulation-linearization technique (RLT)
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Related Items (1)
Uses Software
Cites Work
- A splitter location-allocation problem in designing fiber optic access networks
- Designing a distribution network in a supply chain system: formulation and efficient solution procedure
- A review of hierarchical facility location models
- Formulations and relaxations for a multi-echelon capacitated location-distribution problem
- Strategic network restoration
- Uncapacitated single and multiple allocation \(p\)-hub center problems
- Topological design of telecommunication networks --- local access design methods
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- COBRA: A new formulation of the classic \(p\)-median location problem
- An exact method for the two-echelon, single-source, capacitated facility location problem
- New modeling approaches for the design of local access transport area networks
- Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities
- Combining very large scale and ILP based neighborhoods for a two-level location problem
- BEAMR: an exact and approximate model for the \(p\)-median problem
- Lower and upper bounds for a two-level hierarchical location problem in computer networks
- Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems
- Exactly solving a two-level location problem with modular node capacities
This page was built for publication: A two-level location-allocation problem in designing local access fiber optic networks
