A Particle Swarm Optimization Algorithm for the Multicast Routing Problem

DOI10.1007/978-3-319-09758-9_7zbMATH Open1317.90331OpenAlexW2229834434MaRDI QIDQ5265219FDOQ5265219

Yannis Marinakis, Athanasios Migdalas

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_7

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Cited In (3)

• Efficient computation of shortest paths in networks using particle swarm optimization and noising metaheuristics
• A novel membrane algorithm based on particle swarm optimization for solving broadcasting problems
• Title not available (Why is that?)

Uses Software

• AntNet

Recommendations

• Title not available (Why is that?) 👍 👎
• A tree-based particle swarm optimization for multicast routing 👍 👎
• A Hybrid Metaheuristic for Routing on Multicast Networks 👍 👎

This page was built for publication: A Particle Swarm Optimization Algorithm for the Multicast Routing Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5265219)