On the public citation graph

A Novel Hybrid Ant Colony Optimization for a Multicast Routing Problem

0 signed · 39 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jpdc.2001.1752openalex-snapshot
Delay-Constrained, Low-Cost Multicast Routing in Multimedia Networks
inferredcites →https://doi.org/10.1007/s00500-016-2149-3openalex-snapshot
A EA- and ACA-based QoS multicast routing algorithm with multiple constraints for ad hoc networks
inferredcites →https://doi.org/10.1007/s11277-017-4572-xopenalex-snapshot
CAST-WSN: The Presentation of New Clustering Algorithm Based on Steiner Tree and C-Means Algorithm Improvement in Wireless Sensor Networks
inferredcites →https://doi.org/10.1016/j.adhoc.2016.06.009openalex-snapshot
A micro-artificial bee colony based multicast routing in vehicular ad hoc networks
inferredcites →https://doi.org/10.1016/j.asoc.2012.10.018openalex-snapshot
A genetic algorithm for finding a path subject to two constraints
inferredcites →https://doi.org/10.1016/j.comcom.2008.09.023openalex-snapshot
A method for least-cost QoS multicast routing based on genetic simulated annealing algorithm
inferredcites →https://doi.org/10.1016/j.comnet.2010.05.006openalex-snapshot
A tree-based particle swarm optimization for multicast routing
inferredcites →https://doi.org/10.1016/j.comnet.2016.09.023openalex-snapshot
QoS Routing enhancement using metaheuristic approach in mobile ad-hoc network
inferredcites →https://doi.org/10.1016/j.cor.2003.12.007openalex-snapshot
A survey of combinatorial optimization problems in multicast routing
inferredcites →https://doi.org/10.1016/j.engappai.2014.06.004openalex-snapshot
A novel fuzzy hybrid quantum artificial immune clustering algorithm based on cloud model
inferredcites →https://doi.org/10.1016/j.eswa.2007.08.018openalex-snapshot
Ant colony-based algorithm for constructing broadcasting tree with degree and delay constraints
inferredcites →https://doi.org/10.1016/j.ipl.2003.09.014openalex-snapshot
On approximation algorithms for the terminal Steiner tree problem
inferredcites →https://doi.org/10.1016/j.jnca.2008.03.002openalex-snapshot
Multicast routing for delay variation bound using a modified ant colony algorithm
inferredcites →https://doi.org/10.1016/j.jnca.2013.08.003openalex-snapshot
Niched ant colony optimization with colony guides for QoS multicast routing
inferredcites →https://doi.org/10.1016/j.knosys.2015.09.006openalex-snapshot
A cloud model based fruit fly optimization algorithm
inferredcites →https://doi.org/10.1016/s0140-3664(00)00273-5openalex-snapshot
Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm
inferredcites →https://doi.org/10.1016/s1004-4132(08)60046-8openalex-snapshot
Multi-constraint quality of service routing algorithm for dynamic topology networks
inferredcites →https://doi.org/10.1109/3477.484436openalex-snapshot
Ant system: optimization by a colony of cooperating agents
inferredcites →https://doi.org/10.1109/4235.585892openalex-snapshot
Ant colony system: a cooperative learning approach to the traveling salesman problem
inferredcites →https://doi.org/10.1109/49.564132openalex-snapshot
Evaluation of multicast routing algorithms for real-time communication on high-speed networks
inferredcites →https://doi.org/10.1109/90.234851openalex-snapshot
Multicast routing for multimedia communication
inferredcites →https://doi.org/10.1109/infcom.1991.147651openalex-snapshot
On multicast path finding algorithms

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/dac.4502openalex-snapshot
An improved distance‐based ant colony optimization routing for vehicular ad hoc networks
inferred← citeshttps://doi.org/10.1007/978-3-030-70866-5_23openalex-snapshot
A Novel Heuristic Optimization Algorithm for Solving the Delay-Constrained Least-Cost Problem
inferred← citeshttps://doi.org/10.1007/s11235-026-01443-xopenalex-snapshot
Solving the constrained steiner tree problem in MANETs using an adaptive simulated annealing optimization approach
inferred← citeshttps://doi.org/10.1016/j.eswa.2025.128149openalex-snapshot
Scalable hierarchical balanced clustering-based routing with multipath authentication for secured data transmission in large-scale multicast group communications
inferred← citeshttps://doi.org/10.1016/j.jisa.2024.103927openalex-snapshot
Towards an intelligent and automatic irrigation system based on internet of things with authentication feature in VANET
inferred← citeshttps://doi.org/10.1051/e3sconf/202122901009openalex-snapshot
Solving the Delay-Constrained Least-Cost routing problem using Tabu Search with Edge Betweenness
inferred← citeshttps://doi.org/10.1080/03772063.2023.2253763openalex-snapshot
Swarm Intelligence-Inspired Meta-Heuristics Hybrid Optimization for Multi-Constraint Routing in Vehicular Adhoc Networks
inferred← citeshttps://doi.org/10.1109/nof66640.2025.11223301openalex-snapshot
Multicast Routing Optimization using a Novel Discrete Flower Pollination-based Approach
inferred← citeshttps://doi.org/10.1109/tnsm.2024.3402275openalex-snapshot
DHRL-FNMR: An Intelligent Multicast Routing Approach Based on Deep Hierarchical Reinforcement Learning in SDN
inferred← citeshttps://doi.org/10.1145/3568231.3568252openalex-snapshot
An Intelligent Approach for Solving QoS and Multicast Routing Issues
inferred← citeshttps://doi.org/10.21776/ub.jemis.2019.007.01.4openalex-snapshot
ANT COLONY OPTIMIZATION WITH DOUBLE SELECTIONS FOR SOLVING INTEGRATED SCHEDULING PROBLEM IN MANUFACTURER
inferred← citeshttps://doi.org/10.30598/barekengvol18iss1pp0643-0656openalex-snapshot
THE SAMPLE SCHEDULING APPLICATION OF THE ANT COLONY OPTIMIZATION ALGORITHM IN VEHICLE ROUTING PROBLEM TO FIND THE SHORTEST ROUTE
inferred← citeshttps://doi.org/10.3390/a13100250openalex-snapshot
A Clustering Routing Algorithm Based on Improved Ant Colony Optimization Algorithms for Underwater Wireless Sensor Networks
inferred← citeshttps://doi.org/10.3390/books978-3-0365-1235-8openalex-snapshot
Networks, Communication, and Computing Vol. 2
inferred← citeshttps://doi.org/10.3390/math8071092openalex-snapshot
Settings-Free Hybrid Metaheuristic General Optimization Methods
inferred← citeshttps://doi.org/10.3390/sym13112109openalex-snapshot
ACTS: An Ant Colony Based Transmission Scheduling Approach for Cloud Network Collaboration Environment
inferred← citeshttps://doi.org/10.3934/mbe.2023765openalex-snapshot
Intelligent multicast routing method based on multi-agent deep reinforcement learning in SDWN
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.