New modeling approaches for the design of local access transport area networks
From MaRDI portal
Publication:1590803
DOI10.1016/S0377-2217(99)00325-2zbMath0991.90027OpenAlexW2022272248MaRDI QIDQ1590803
Youngho Lee, Taehyung Park, Hanif D. Sherali
Publication date: 21 December 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00325-2
integer programmingtelecommunication networksreformulation-linearization techniqueLagrangian relaxations
Related Items
A two-level location-allocation problem in designing local access fiber optic networks, Optimizing splitter and fiber location in a multilevel optical FTTH network, Designing Reliable IP Networks with an Access/Edge/Core Hierarchical Structure, A splitter location-allocation problem in designing fiber optic access networks, Towards optimizing the deployment of optical access networks, Allocating nodes to hubs for minimizing the hubs processing resources: A case study
Cites Work
- Unnamed Item
- Models for planning capacity expansion in local access telecommunication networks
- Heuristics for the capacitated plant location model
- Design of survivable networks
- Valid inequalities and facets of the capacitated plant location problem
- Capacitated facility location: Separation algorithms and computational experience
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- A variable target value method for nondifferentiable optimization
- Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
- Valid Linear Inequalities for Fixed Charge Problems
- Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
- Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
- Large-Scale Network Topological Optimization
- Capacitated Facility Location: Valid Inequalities and Facets
- Capacitated Network Design—Polyhedral Structure and Computation
