On the public citation graph
Parallel Framework for Ant-Like Algorithms
0 signed · 20 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4613-3279-4_6openalex-snapshot
Parallelization Strategies for the Ant System
inferredcites →https://doi.org/10.1007/978-1-4615-1507-4openalex-snapshot
Essays and Surveys in Metaheuristics
inferredcites →https://doi.org/10.1007/bfb0056914openalex-snapshot
Parallelization strategies for Ant Colony Optimization
inferredcites →https://doi.org/10.1007/bfb0097905openalex-snapshot
Parallel ant colonies for combinatorial optimization problems
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/mhs.2002.1058041openalex-snapshot
A new approach to exploiting parallelism in ant colony optimization
inferredcites →https://doi.org/10.1162/106454699568728openalex-snapshot
Ant Algorithms for Discrete Optimization
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-11881-5_12openalex-snapshot
A Parallel Approach to Optimize the Supply Chain Management
inferred← citeshttps://doi.org/10.1016/j.asoc.2011.05.042openalex-snapshot
A survey on parallel ant colony optimization
inferred← citeshttps://doi.org/10.1016/j.asoc.2021.108058openalex-snapshot
An efficient ant colony optimization framework for HPC environments
inferred← citeshttps://doi.org/10.1016/j.jpdc.2012.01.003openalex-snapshot
Parallel Ant Colony Optimization on Graphics Processing Units
inferred← citeshttps://doi.org/10.1016/j.swevo.2016.06.006openalex-snapshot
Effective heuristics for ant colony optimization to handle large-scale problems
inferred← citeshttps://doi.org/10.1109/bigdata47090.2019.9006311openalex-snapshot
Parallel R Computing on the Web
inferred← citeshttps://doi.org/10.1109/icnc.2012.6234645openalex-snapshot
A MapReduce based Ant Colony Optimization approach to combinatorial optimization problems
inferred← citeshttps://doi.org/10.1109/nabic.2009.5393729openalex-snapshot
Multi-colony parallel ant colony optimization on SMP and multi-core computers
inferred← citeshttps://doi.org/10.1145/2897373openalex-snapshot
Transparent and Efficient Parallelization of Swarm Algorithms
inferred← citeshttps://doi.org/10.52846/ami.v41i2.628openalex-snapshot
Survey on distributed approaches to swarm intelligence for graph search problems
inferred← citeshttps://doi.org/10.5772/54252openalex-snapshot
Parallel Ant Colony Optimization: Algorithmic Models and Hardware Implementations
inferred← citeshttps://doi.org/10.70675/02e94438z1a94z4bb0z9966z2a0088eb2df7openalex-snapshot
Métaheuristiques pour l'optimisation combinatoire sur processeurs graphiques (GPU)
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.