Minimum cost multicast routing using ant colony optimization algorithm

DOI10.1155/2013/432686zbMath1299.90399OpenAlexW2099490960WikidataQ59027502 ScholiaQ59027502MaRDI QIDQ473657

Xiao-Min Hu, Jun Zhang

Publication date: 24 November 2014

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/432686

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• OR-Library
• AntNet

Cites Work

• A fast algorithm for Steiner trees
• Path-distance heuristic for the Steiner problem in undirected networks
• On finding steiner vertices
• Routing to Multiple Destinations in Computer Networks
• The computation of nearly minimal Steiner trees in graphs
• Steiner Minimal Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimum cost multicast routing using ant colony optimization algorithm