A Hybrid Metaheuristic for Routing on Multicast Networks

DOI10.1007/978-3-319-09758-9_9zbMath1317.90333OpenAlexW963068599MaRDI QIDQ5265221

Carlos A. S. Oliveira, Panos M. Pardalos

Publication date: 23 July 2015

Published in: Models, Algorithms and Technologies for Network Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-09758-9_9

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Variable neighborhood search
• Greedy randomized adaptive search procedures
• A heuristic for the Steiner problem in graphs
• A survey of combinatorial optimization problems in multicast routing
• An annotated bibliography of GRASP-Part II: Applications
• A GRASP with path-relinking for private virtual circuit routing
• Steiner Minimal Trees

This page was built for publication: A Hybrid Metaheuristic for Routing on Multicast Networks