Designing reliable tree networks with two cable technologies

DOI10.1016/S0377-2217(97)00067-2MaRDI QIDQ1291775zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

reliabilitytreesmulticommodity flowshop constraints

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

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

• scientific article; zbMATH DE number 3614502 (Why is no real title available?)
• scientific article; zbMATH DE number 795222 (Why is no real title available?)
• 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
• Lagrangean heuristics for location problems
• Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem
• Multicommodity flow models for spanning trees with hop constraints
• Using a Hop-Constrained Model to Generate Alternative Communication Network Design
• Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
• Validation of subgradient optimization

Cited in

(6)

• Differential approximation of NP-hard problems with equal size feasible solutions
• Designing a minimal spanning tree network subject to a budget constraint
• The maximum \(f\)-depth spanning tree problem
• Optimizing splitter and fiber location in a multilevel optical FTTH network
• Minimum-weight subgraphs with unicyclic components and a lower-bounded girth
• Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs.

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)