Hop-constrained node survivable network design: An application to MPLS over WDM
type: Item
instance of: scholarly article
title: Hop-constrained node survivable network design: An application to MPLS over WDM
zbMATH Open document ID: 1172.90339
author: Luis Gouveia
author: Pedro Patrício
author: Amaro de Sousa
published in: Networks and Spatial Economics
publication date: 2009-11-04T00:00:00Z
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 5624962
zbMATH Keywords: MPLS over WDM network design
zbMATH Keywords: survivability
zbMATH Keywords: hop constraints
MaRDI profile type: Publication
full work available at URL: s11067-007-9038-3
OpenAlex ID: W2026420755
cites work: Using a Hop-Constrained Model to Generate Alternative Communication Network Design
cites work: Connectivity-splitting models for survivable network design
cites work: Design of survivable IP-over-optical networks
cites work: Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
cites work: Two Edge-Disjoint Hop-Constrained Paths and Polyhedra
cites work: The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut
cites work: Packet Routing in Telecommunication Networks with Path and Flow Restrictions
cites work: Strong formulations for network design problems with connectivity requirements
cites work: Modeling and Solving the Two-Facility Capacitated Network Loading Problem
cites work: Q4398376
cites work: Design of survivable networks
DOI: 10.1007/S11067-007-9038-3
description: scientific article; zbMATH DE number 5624962