On the public citation graph
Genetic algorithms: Minimal conditions for convergence
0 signed · 26 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/0-387-32792-4openalex-snapshot
Non-negative Matrices and Markov Chains
inferredcites →https://doi.org/10.1007/978-3-7091-7535-4_56openalex-snapshot
Convergence of Algorithm and the Schema Theorem in Genetic Algorithms
inferredcites →https://doi.org/10.1007/bf01530781openalex-snapshot
Modeling genetic algorithms with Markov chains
inferredcites →https://doi.org/10.1007/bfb0029723openalex-snapshot
Parallel Problem Solving from Nature
inferredcites →https://doi.org/10.1007/bfb0029725openalex-snapshot
Global convergence of genetic algorithms: A markov chain analysis
inferredcites →https://doi.org/10.1016/b978-0-08-094832-4.50010-6openalex-snapshot
Modeling Simple Genetic Algorithms
inferredcites →https://doi.org/10.1109/72.265964openalex-snapshot
Convergence analysis of canonical genetic algorithms
inferredcites →https://doi.org/10.1109/72.265965openalex-snapshot
Theoretical analysis of evolutionary algorithms with an infinite population size in continuous space. Part I: Basic properties of selection and mutation
inferredcites →https://doi.org/10.1162/evco.1993.1.3.269openalex-snapshot
A Markov Chain Framework for the Simple Genetic Algorithm
inferredcites →https://doi.org/10.2307/2287861openalex-snapshot
Finite Markov Processes and Their Applications.
inferredcites →https://doi.org/10.7551/mitpress/1090.001.0001openalex-snapshot
Adaptation in Natural and Artificial Systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-45356-3_11openalex-snapshot
Perturbation Theory for Evolutionary Algorithms: Towards an Estimation of Convergence Speed
inferred← citeshttps://doi.org/10.1007/978-3-642-10701-6_7openalex-snapshot
Analysis of Approximation-Based Memetic Algorithms for Engineering Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-17339-4_3openalex-snapshot
Theoretical Perspectives on Evolutionary Algorithms
inferred← citeshttps://doi.org/10.1007/s10479-024-06112-3openalex-snapshot
Analysis and improvement of the binary particle swarm optimization
inferred← citeshttps://doi.org/10.1016/s0020-7683(01)00189-5openalex-snapshot
The effective properties of a perforated elastic plate Numerical optimization by genetic algorithm
inferred← citeshttps://doi.org/10.1029/2000wr900411openalex-snapshot
A multipopulation genetic algorithm to solve the inverse problem in hydrogeology
inferred← citeshttps://doi.org/10.1109/cec.1999.782005openalex-snapshot
Adaptive genetic algorithms-modeling and convergence
inferred← citeshttps://doi.org/10.1109/cec.2000.870756openalex-snapshot
Convergence properties of some multi-objective evolutionary algorithms
inferred← citeshttps://doi.org/10.1109/icsmc.2006.384853openalex-snapshot
Stabilization of Nonholonomic System Using Evolutionary Strategies
inferred← citeshttps://doi.org/10.1162/evco.1999.7.2.173openalex-snapshot
Rigorous Hitting Times for Binary Mutations
inferred← citeshttps://doi.org/10.1162/evco_a_00033openalex-snapshot
Evolutionary Squeaky Wheel Optimization: A New Framework for Analysis
inferred← citeshttps://doi.org/10.15517/rmta.v8i2.201openalex-snapshot
Modeling genetic algorithms with interacting particle systems
inferred← citeshttps://doi.org/10.3233/fi-1998-35123405openalex-snapshot
Finite Markov Chain Results in Evolutionary Computation: A Tour d'Horizon
inferred← citeshttps://doi.org/10.37099/mtu.dc.etdr/643openalex-snapshot
System Architecture Optimization Using Hidden Genes Genetic Algorithms with Applications in Space Trajectory Optimization
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.