Designing reliable tree networks with two cable technologies
From MaRDI portal
Publication:1291775
DOI10.1016/S0377-2217(97)00067-2zbMATH Open0955.90009OpenAlexW2082883608MaRDI QIDQ1291775FDOQ1291775
Authors: Eric Janssen, Luis Gouveia
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
Recommendations
- A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
- The capacitated minimal spanning tree problem: An experiment with a hop-indexed model
- Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs.
- Multicommodity flow models for spanning trees with hop constraints
- Designing a minimal spanning tree network subject to a budget constraint
Cites Work
- Lagrangean heuristics for location problems
- Title not available (Why is that?)
- Validation of subgradient optimization
- Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
- Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem
- Title not available (Why is that?)
- Multicommodity flow models for spanning trees with hop constraints
- Using a Hop-Constrained Model to Generate Alternative Communication Network Design
- A catalog of steiner tree formulations
- A test problem generator for the Steiner problem in graphs
- Arborescence polytopes for series-parallel graphs
- Finding Disjoint Routes in Telecommunications Networks with Two Technologies
Cited In (6)
- Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs.
- Minimum-weight subgraphs with unicyclic components and a lower-bounded girth
- The maximum \(f\)-depth spanning tree problem
- Optimizing splitter and fiber location in a multilevel optical FTTH network
- Designing a minimal spanning tree network subject to a budget constraint
- Differential approximation of NP-hard problems with equal size feasible solutions
This page was built for publication: Designing reliable tree networks with two cable technologies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1291775)