On the public citation graph

A hybrid sand cat swarm optimization algorithm for generalized vertex cover problem

0 signed · 22 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.1002/rob.20300openalex-snapshot
Coverage path planning algorithms for agricultural field machines
inferredcites →https://doi.org/10.1007/s00366-022-01604-xopenalex-snapshot
Sand Cat swarm optimization: a nature-inspired algorithm to solve global optimization problems
inferredcites →https://doi.org/10.1007/s00500-023-07982-8openalex-snapshot
An evolutionary game algorithm for minimum weighted vertex cover problem
inferredcites →https://doi.org/10.1007/s00521-015-2172-9openalex-snapshot
A local search algorithm with tabu strategy and perturbation mechanism for generalized vertex cover problem
inferredcites →https://doi.org/10.1007/s10489-018-1391-zopenalex-snapshot
Generalized vertex cover using chemical reaction optimization
inferredcites →https://doi.org/10.1007/s11227-023-05397-8openalex-snapshot
A new robust approach to solve minimum vertex cover problem: Malatya vertex-cover algorithm
inferredcites →https://doi.org/10.1007/s11590-015-0851-1openalex-snapshot
Exact solutions to generalized vertex covering problems: a comparison of two models
inferredcites →https://doi.org/10.1007/s12293-016-0216-zopenalex-snapshot
A hybrid metaheuristic algorithm for generalized vertex cover problem
inferredcites →https://doi.org/10.1016/j.asoc.2012.02.013openalex-snapshot
A population-based iterated greedy algorithm for the minimum weight vertex cover problem
inferredcites →https://doi.org/10.1016/j.ins.2016.08.053openalex-snapshot
An efficient local search framework for the minimum weighted vertex cover problem
inferredcites →https://doi.org/10.1016/j.ins.2018.08.052openalex-snapshot
Towards faster local search for minimum weight vertex cover on massive graphs
inferredcites →https://doi.org/10.1016/j.omega.2019.08.009openalex-snapshot
The vertex cover game: Application to transport networks
inferredcites →https://doi.org/10.1016/j.proeng.2016.01.248openalex-snapshot
An Approximation Algorithm for the Minimum Vertex Cover Problem
inferredcites →https://doi.org/10.1023/b:anor.0000039523.95673.33openalex-snapshot
An Ant Colony Optimization Algorithm for the Minimum Weight Vertex Cover Problem
inferredcites →https://doi.org/10.1080/01605682.2019.1621218openalex-snapshot
NuMWVC: A novel local search for minimum weighted vertex cover problem
inferredcites →https://doi.org/10.1080/01605682.2022.2147458openalex-snapshot
ILSGVCP: An improved local search algorithm for generalized vertex cover problem
inferredcites →https://doi.org/10.1109/access.2019.2915550openalex-snapshot
MEAMVC: A Membrane Evolutionary Algorithm for Solving Minimum Vertex Cover Problem
inferredcites →https://doi.org/10.1109/access.2021.3051741openalex-snapshot
A Fast and Robust Heuristic Algorithm for the Minimum Weight Vertex Cover Problem
inferredcites →https://doi.org/10.1145/1125994.1125998openalex-snapshot
The minimum generalized vertex cover problem
inferredcites →https://doi.org/10.1613/jair.3907openalex-snapshot
NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover
inferredcites →https://doi.org/10.3390/bioengineering10101123openalex-snapshot
An Efficient Binary Sand Cat Swarm Optimization for Feature Selection in High-Dimensional Biomedical Data
inferredcites →https://doi.org/10.3390/biomimetics8030310openalex-snapshot
Binary Sand Cat Swarm Optimization Algorithm for Wrapper Feature Selection on Biological Data
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.