Applying tabu search to backup path planning for multicast networks
type: Item
instance of: scholarly article
title: Applying tabu search to backup path planning for multicast networks
zbMATH Open document ID: 1071.90053
author: Chyi-Bao Yang
author: Ue-Pyng Wen
published in: Computers \& Operations Research
publication date: 2005-06-27T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90B18
zbMATH DE Number: 2183201
zbMATH Keywords: Tabu search
zbMATH Keywords: Network survivability
zbMATH Keywords: QoS
zbMATH Keywords: Multicast communication
describes a project that uses: Tabu search
MaRDI profile type: Publication
full work available at URL: j.cor.2004.04.018
OpenAlex ID: W2013114753
cites work: A note on distributed multicast routing in point-to-point networks
cites work: Delay-constrained, low-cost multicast routing in multimedia networks
cites work: Future paths for integer programming and links to artificial intelligence
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: An efficient tabu search approach for the two-machine preemptive open shop scheduling problem.
cites work: Path assignment for call routing: An application of tabu search
cites work: Bandwidth Packing: A Tabu Search Approach
cites work: Applying tabu search to spare capacity planning for network restoration
DOI: 10.1016/J.COR.2004.04.018
description: scientific article; zbMATH DE number 2183201