A two-level location-allocation problem in designing local access fiber optic networks

DOI10.1016/J.COR.2014.05.005MaRDI QIDQ337111zbMATH OpenOpenAlexFDO

Authors Gigyoung Park, Youngho Lee, Junghee Han

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

zbMATH Keywords

mixed integer programmingaccess networksfiber optic access networksMIP-based tree partitioning heuristicreformulation-linearization technique (RLT)

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Mixed integer programming (90C11) Discrete location and assignment (90B80)

Recommendations

• A splitter location-allocation problem in designing fiber optic access networks
• Solving local access network design problem with two technologies
• Model and heuristic for a generalized access network design problem
• Towards optimizing the deployment of optical access networks
• Design of fiber cable tree FTTH networks

Cites work

• A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
• A review of hierarchical facility location models
• A splitter location-allocation problem in designing fiber optic access networks
• An exact method for the two-echelon, single-source, capacitated facility location problem
• BEAMR: an exact and approximate model for the \(p\)-median problem
• COBRA: A new formulation of the classic \(p\)-median location problem
• Combining very large scale and ILP based neighborhoods for a two-level location problem
• Designing a distribution network in a supply chain system: formulation and efficient solution procedure
• Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities
• Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
• Exactly solving a two-level location problem with modular node capacities
• Exploiting special structures in constructing a hierarchy of relaxations for \(0-1\) mixed integer problems
• Formulations and relaxations for a multi-echelon capacitated location-distribution problem
• Lower and upper bounds for a two-level hierarchical location problem in computer networks
• New modeling approaches for the design of local access transport area networks
• Strategic network restoration
• Topological design of telecommunication networks --- local access design methods
• Uncapacitated single and multiple allocation \(p\)-hub center problems

Cited in

(14)

• Solving local access network design problem with two technologies
• Node placement and sizing for copper broadband access networks
• Design of fiber cable tree FTTH networks
• Fiber cable network design in tree networks
• Long-distance access network design
• A multi-commodity flow approach for the design of the last mile in real-world fiber optic networks
• A heuristic algorithm for a prize-collecting local access network design problem
• New formulations and solution procedures for the hop constrained network design problem.
• Cost optimized layout of fibre optic networks in the access net domain
• A splitter location-allocation problem in designing fiber optic access networks
• Lagrangian decompositions for the two-level FTTx network design problem
• New modeling approaches for the design of local access transport area networks
• Optimizing splitter and fiber location in a multilevel optical FTTH network
• Tight lower bounds for the traveling salesman problem with draft limits

Describes a project that uses

Uses Software

• BEAMR

This page was built for publication: A two-level location-allocation problem in designing local access fiber optic networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337111)