Designing reliable tree networks with two cable technologies
From MaRDI portal
Publication:1291775
DOI10.1016/S0377-2217(97)00067-2zbMath0955.90009OpenAlexW2082883608MaRDI QIDQ1291775
Publication date: 22 February 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00067-2
Related Items
Minimum‐weight subgraphs with unicyclic components and a lower‐bounded girth ⋮ Optimizing splitter and fiber location in a multilevel optical FTTH network ⋮ Differential approximation of NP-hard problems with equal size feasible solutions ⋮ The maximum \(f\)-depth spanning tree problem
Cites Work
- Unnamed Item
- Unnamed Item
- Multicommodity flow models for spanning trees with hop constraints
- Arborescence polytopes for series-parallel graphs
- Lagrangean heuristics for location problems
- Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
- Using a Hop-Constrained Model to Generate Alternative Communication Network Design
- Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem
- A test problem generator for the Steiner problem in graphs
- Finding Disjoint Routes in Telecommunications Networks with Two Technologies
- Validation of subgradient optimization
- A catalog of steiner tree formulations
