The network design problem with relays
type: Item
instance of: scholarly article
title: The network design problem with relays
zbMATH Open document ID: 1125.90010
author: Edgar Alberto Cabral
author: Erhan Erkut
author: G. Laporte
author: Raymond A. Patterson
published in: European Journal of Operational Research
publication date: 2007-03-08T00:00:00Z
full work available at URL: http://hdl.handle.net/11693/23426
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5131608
zbMATH Keywords: network design
zbMATH Keywords: telecommunications
zbMATH Keywords: column generation
zbMATH Keywords: heuristic
describes a project that uses: SONET
describes a project that uses: SPIDER
MaRDI profile type: Publication
OpenAlex ID: W2067773876
cites work: Q4398375
cites work: Decision support system for planning telecommunication networks: a case study applied to the Andalusian region
cites work: A survey on Benders decomposition applied to fixed-charge network design problems
cites work: On the impact of the solution representation for the Internet Protocol Network Design Problem with max-hop constraints
cites work: Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
cites work: A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
cites work: Selected Topics in Column Generation
cites work: Q4398376
cites work: Hop constrained network design problem with partial survivability
cites work: Q3874241
cites work: The Steiner tree problem with hop constraints
cites work: Design of a distributed finer transport network with hubbing topology
DOI: 10.1016/J.EJOR.2006.04.030
description: scientific article; zbMATH DE number 5131608