A GRASP heuristic for the delay-constrained multicast routing problem

No abstract is available for this paper.

• Publication year

  2006

• Venue

  Telecommunications Systems

• Publication date

  2006-05-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/s11235-006-8202-2
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• The application of Steiner trees to delay constrained multicast routing: a tabu search approach

  2003cited by this paper
• A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs

  2002cited by this paper
• A Parallel Grasp for the Steiner Tree Problem in Graphs Using a Hybrid Local Search Strategy

  2000cited by this paper
• A genetic algorithm for multicasting routing problem

  2000cited by this paper
• An orthogonal genetic algorithm for multimedia multicast routing

  1999cited by this paper
• Greedy randomized adaptive search procedures for the Steiner problem in graphs

  1997cited by this paper
• Cost, Delay, and Delay Variation Conscious Multicast Routing

  1997cited by this paper
• A source-based algorithm for delay-constrained minimum-cost multicasting

  1995cited by this paper
• Multicast routing for multimedia communication

  1993cited by this paper
• The NP-Completeness Column: An Ongoing Guide

  1982cited by this paper
• Konrad-zuse-zentrum F ¨ Ur Informationstechnik Berlin Steinlib: an Updated Library on Steiner Tree Problems in Graphs

  year unknowncited by this paper

• Multicast Routing Optimization using a Novel Discrete Flower Pollination-based Approach

  2025cites this paper
• Solving the Delay-Constrained Least-Cost routing problem using Tabu Search with Edge Betweenness

  2021cites this paper
• A Novel Heuristic Optimization Algorithm for Solving the Delay-Constrained Least-Cost Problem

  2020cites this paper
• Quality of Service (QoS) Optimization in a Multicast Routing: A Hybrid Solution

  2019cites this paper
• A Steiner point candidate-based heuristic framework for the Steiner tree problem in graphs

  2016cites this paper
• A Population-based Local Search Technique with Random Descent and Jump for the Steiner Tree Problem in Graphs

  2016influential citation
• Key-node-based local search discrete artificial bee colony algorithm for obstacle-avoiding rectilinear Steiner tree construction

  2015cites this paper
• A GRASP for the Steiner Tree Problem in Graphs to Support Multicast Routing

  2015cites this paper
• Solution for multicast routing problem using particle swarm optimization

  2015cites this paper
• Bi-Velocity Discrete Particle Swarm Optimization and Its Application to Multicast Routing Problem in Communication Networks

  2014influential citation
• A Particle Swarm Optimization-Like Algorithm for Constrained Minimal Spanning Tree Problems

  2014cites this paper
• Four-objective formulations of multicast flows via evolutionary algorithms with quality demands

  2014cites this paper
• Particle swarm optimization for the Steiner tree in graph and delay-constrained multicast routing problems

  2013influential citation
• A New Hybrid GRASP with the Pilot Method Forthe Delay-Constrained Multicast Routing Problem

  2013influential citation
• A simulated annealing based genetic local search algorithm for multi-objective multicast routing problems

  2013cites this paper
• Delay constrained multicast routing: What can we learn from an exact approach?

  2012cites this paper
• An iterative local search approach based on fitness landscapes analysis for the delay-constrained multicast routing problem

  2012influential citation
• On Solving Constrained Tree Problems and an Adaptive Layers Framework

  2012influential citation
• GRASP-BSMA: A fast algorithm for delay constrained multicast routing

  2012influential citation
• A modified implementation of bounded shortest multicast algorithm for constrained multicast routing

  2012cites this paper
• A Multilevel Refinement Approach to the Rooted Delay-Constrained Steiner Tree Problem

  2011cites this paper
• Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem

  2011cites this paper
• Four-Objective Formulations of Multicast Flows Through Evolutionary Routing with QoS and Traffic Engineering

  2011cites this paper
• Stabilized Column Generation for the Rooted Delay-Constrained Steiner Tree Problem

  2011cites this paper
• Solving multi-objective multicast routing problems by evolutionary multi-objective simulated annealing algorithms with variable neighbourhoods

  2011cites this paper
• A hybrid scatter search meta-heuristic for delay-constrained multicast routing problems

  2010cites this paper
• Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem

  2010influential citation
• A GRASP approach for the delay-constrained multicast routing problem

  2009influential citation
• Automatic construction of a minimum size motion graph

  2009cites this paper
• A Variable Neighborhood Descent Search Algorithm for Delay-Constrained Least-Cost Multicast Routing

  2009cites this paper
• A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem

  2009cites this paper
• Constructing good quality motion graphs for realistic human animation

  2009cites this paper
• A Variable Descent Search Algorithm for Delay-Constrained Least-Cost Multicast Routing

  2008influential citation